| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657013 | Journal of Combinatorial Theory, Series B | 2012 | 10 Pages |
Abstract
In this paper, we show that for any even integer t⩾4, every 3-connected graph with no K3,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].
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
