Spanning trees in 3-connected K3, t-minor-free graphs

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].

[1]  W. Mader.  Ecken vom Gradn in minimalenn-fach zusammenhängenden Graphen , 1972 .

[2]  Xingxing Yu,et al.  The circumference of a graph with no K3, t-minor , 2006, J. Comb. Theory, Ser. B.

[3]  Xingxing Yu,et al.  Disjoint paths, planarizing cycles, and spanning walks , 1997 .

[4]  Carsten Thomassen,et al.  A theorem on paths in planar graphs , 1983, J. Graph Theory.

[5]  Zhicheng Gao,et al.  Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle , 1995, J. Comb. Theory, Ser. B.

[6]  Atsuhiro Nakamoto,et al.  3-trees with Few Vertices of Degree 3 in Circuit Graphs , 2009, Discret. Math..

[7]  R. Halin.  A theorem on n-connected graphs , 1969 .

[8]  J. Moon,et al.  Simple paths on polyhedra. , 1963 .

[9]  Xingxing Yu,et al.  Long Cycles in 3-Connected Graphs , 2002, J. Comb. Theory, Ser. B.

[10]  Ken-ichi Kawarabayashi,et al.  Toughness of Ka,t-Minor-Free Graphs , 2011, Electron. J. Comb..

[11]  Carsten Thomassen.  Trees in Triangulations , 1994, J. Comb. Theory, Ser. B.

[12]  Katsuhiro Ota,et al.  Spanning trees in 3-connected K3, t-minor-free graphs , 2009, Electron. Notes Discret. Math..

[13]  W. T. Tutte.  A THEOREM ON PLANAR GRAPHS , 1956 .

[14]  Yue Zhao,et al.  On spanning trees and walks of low maximum degree , 2001 .

[15]  Andrew U. Frank,et al.  How to orient the edges of a graph? in Combinatorics , 1976 .

[16]  Zhicheng Gao,et al.  Spanning Trees in Locally Planar Triangulations , 1994, J. Comb. Theory, Ser. B.

[17]  Ken-ichi Kawarabayashi,et al.  Subgraphs of graphs on surfaces with high representativity , 2003, J. Comb. Theory, Ser. B.

[18]  R. Halin.  Untersuchungen über minimalen-fach zusammenhängende Graphen , 1969 .

[19]  D. Barnette.  Trees in Polyhedral Graphs , 1966, Canadian Journal of Mathematics.

[20]  David Barnette.  3-Trees in polyhedral maps , 1992 .