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)  and the one by Chen, Egawa, Kawarabayashi, Mohar, and Ota (2011) .
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics