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

Authors:
Katsuhiro Ota;Kenta Ozeki
Affiliations:
Department of Mathematics, Keio University, 3-14-1, Hiyoshi, Kohoku-ku, Yokohama 223-0061, Japan;National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 7
Cited 0

Trees in triangulations

Journal of Combinatorial Theory Series B
Spanning trees in locally planar triangulations

Journal of Combinatorial Theory Series B
Spanning planar subgraphs of graphs in the torus and Klein bottle

Journal of Combinatorial Theory Series B
Long cycles in 3-connected graphs

Journal of Combinatorial Theory Series B
Subgraphs of graphs on surfaces with high representativity

Journal of Combinatorial Theory Series B
The circumference of a graph with no K3,t-minor

Journal of Combinatorial Theory Series B
On spanning trees and walks of low maximum degree

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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