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

Katsuhiro Ota; Kenta Ozeki

doi:10.1016/j.jctb.2012.07.002

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

Katsuhiro Ota, Kenta Ozeki

Department of Mathematics

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	1179-1188
Number of pages	10
Journal	Journal of Combinatorial Theory. Series B
Volume	102
Issue number	5
DOIs	https://doi.org/10.1016/j.jctb.2012.07.002
Publication status	Published - 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

Access to Document

10.1016/j.jctb.2012.07.002

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

@article{1efc06ed96094d999c52ebaf35bf258c,

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

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

keywords = "Graphs on a surface, K -minor-free graphs, Spanning trees",

author = "Katsuhiro Ota and Kenta Ozeki",

year = "2012",

month = sep,

day = "1",

doi = "10.1016/j.jctb.2012.07.002",

language = "English",

volume = "102",

pages = "1179--1188",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "5",

}

TY - JOUR

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

AU - Ota, Katsuhiro

AU - Ozeki, Kenta

PY - 2012/9/1

Y1 - 2012/9/1

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

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

KW - Graphs on a surface

KW - K -minor-free graphs

KW - Spanning trees

UR - http://www.scopus.com/inward/record.url?scp=84865280649&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84865280649&partnerID=8YFLogxK

U2 - 10.1016/j.jctb.2012.07.002

DO - 10.1016/j.jctb.2012.07.002

M3 - Article

AN - SCOPUS:84865280649

VL - 102

SP - 1179

EP - 1188

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 5

ER -