TY - JOUR
T1 - Spanning trees in 3-connected K 3,t-minor-free graphs
AU - Ota, Katsuhiro
AU - Ozeki, Kenta
N1 - Funding Information:
E-mail addresses: ohta@math.keio.ac.jp (K. Ota), ozeki@nii.ac.jp (K. Ozeki). 1 Research partly supported by JSPS, Grant-in-Aid for Scientific Research (B). 2 Research Fellow of the Japan Society for the Promotion of Science.
PY - 2012/9
Y1 - 2012/9
N2 - In this paper, we show that for any even integer t≥4, every 3-connected graph with no K 3,t-minor has a spanning tree whose maximum degree is at most t-1. This result is a common generalization of the result by Barnette (1966) [1] and the one by Chen, Egawa, Kawarabayashi, Mohar, and Ota (2011) [4].
AB - In this paper, we show that for any even integer t≥4, every 3-connected graph with no K 3,t-minor has a spanning tree whose maximum degree is at most t-1. This result is a common generalization of the result by Barnette (1966) [1] and the one by Chen, Egawa, Kawarabayashi, Mohar, and Ota (2011) [4].
KW - Graphs on a surface
KW - K -minor-free graphs
KW - Spanning trees
UR - http://www.scopus.com/inward/record.url?scp=84865280649&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865280649&partnerID=8YFLogxK
U2 - 10.1016/j.jctb.2012.07.002
DO - 10.1016/j.jctb.2012.07.002
M3 - Article
AN - SCOPUS:84865280649
SN - 0095-8956
VL - 102
SP - 1179
EP - 1188
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 5
ER -