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

Katsuhiro Ota, Kenta Ozeki

研究成果: Article

4 引用 (Scopus)

抜粋

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

元の言語English
ページ(範囲)1179-1188
ページ数10
ジャーナルJournal of Combinatorial Theory. Series B
102
発行部数5
DOI
出版物ステータスPublished - 2012 9 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

フィンガープリント Spanning trees in 3-connected K <sub>3,t</sub>-minor-free graphs' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用