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

Katsuhiro Ota, Kenta Ozeki

Research output: Contribution to journalArticle

4 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)1179-1188
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Volume102
Issue number5
DOIs
Publication statusPublished - 2012 Sep 1

Keywords

  • Graphs on a surface
  • K -minor-free graphs
  • Spanning trees

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Spanning trees in 3-connected K <sub>3,t</sub>-minor-free graphs'. Together they form a unique fingerprint.

Cite this