On the excluded minor structure theorem for graphs of large tree-width

DOI10.1016/j.jctb.2012.07.001zbMath1256.05229arXiv0910.0946OpenAlexW2051655695MaRDI QIDQ1931397

Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan, Theodor Müller

Publication date: 14 January 2013

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

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

zbMATH Keywords

tree-widthgraph minorsstructure theoremnear-embedding

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items

The Erdős-Pósa property for clique minors in highly connected graphs, Turing kernelization for finding long paths in graph classes excluding a topological minor, Linear connectivity forces large complete bipartite minors, Unnamed Item

Cites Work

• The Erdős-Pósa property for clique minors in highly connected graphs
• \(K_{6}\) minors in large 6-connected graphs
• Linearity of grid minors in treewidth with applications through bidimensionality
• Linear connectivity forces large complete bipartite minors
• Graph minors. V. Excluding a planar graph
• Graph minors. X: Obstructions to tree-decomposition
• Highly connected sets and the excluded grid theorem
• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. XVII: Taming a vortex
• Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item