\(K_{6}\) minors in 6-connected graphs of bounded tree-width

DOI10.1016/j.jctb.2017.08.006zbMath1414.05274arXiv1203.2171OpenAlexW2129193084MaRDI QIDQ2421546

Serguei Norine, Paul Wollan, Ken-ichi Kawarabayashi, Robin Thomas

Publication date: 17 June 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.2171

zbMATH Keywords

graph minortree-widthJørgensen's conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph minors (05C83) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Non-planar extensions of subdivisions of planar graphs, Optimal 1-planar multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-planar extensions of subdivisions of planar graphs
• \(K_{6}\) minors in large 6-connected graphs
• Graph minors. III. Planar tree-width
• Typical subgraphs of 3- and 4-connected graphs
• Linear connectivity forces large complete bipartite minors: [J. Combin. Theory ser. B vol. 99, issue 2]
• Graph minors. V. Excluding a planar graph
• A Menger-like property of tree-width: The finite case
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• S-functions for graphs
• Highly connected sets and the excluded grid theorem
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Quickly excluding a planar graph
• Extending partial 3-colourings in a planar graph
• Graph minors. IX: Disjoint crossed paths
• \(K_{a,k}\) minors in graphs of bounded tree-width
• Über trennende Eckenmengen in homomorphiekritischen Graphen
• Contractions to k₈
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs