Spanning trees in 3-connected -minor-free graphs

详细信息    查看全文

• 作者：Katsuhiro Ota ; Kenta Ozeki
• 关键词：K3 ; t-minor-free graphs ; Spanning trees ; Graphs on a surface
• 刊名：Journal of Combinatorial Theory, Series B
• 出版年：2012
• 出版时间：September, 2012
• 年：2012
• 卷：102
• 期：5
• 页码：1179-1188
• 全文大小：212 K

文摘

In this paper, we show that for any even integer , every 3-connected graph with no -minor has a spanning tree whose maximum degree is at most . This result is a common generalization of the result by Barnette (1966) and the one by Chen, Egawa, Kawarabayashi, Mohar, and Ota (2011) .