Tree-width and planar minors

DOI10.1016/j.jctb.2014.09.003zbMath1307.05208OpenAlexW2157950582MaRDI QIDQ2259855

Alexander Leaf, P. D. Seymour

Publication date: 5 March 2015

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2014.09.003

zbMATH Keywords

tree-widthgraph minors

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83) Distance in graphs (05C12)

Related Items (11)

An edge variant of the Erdős-Pósa property ⋮ Contraction bidimensionality of geometric intersection graphs ⋮ Towards the Graph Minor Theorems for Directed Graphs ⋮ Low Polynomial Exclusion of Planar Graph Patterns ⋮ Parameters Tied to Treewidth ⋮ Minor-Closed Graph Classes with Bounded Layered Pathwidth ⋮ Towards tight(er) bounds for the excluded grid theorem ⋮ Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor ⋮ Finding Detours is Fixed-Parameter Tractable ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

Cites Work

• Unnamed Item
• Graph minors. XXI. graphs with unique linkages
• Graph minors. V. Excluding a planar graph
• Quickly excluding a forest
• Highly connected sets and the excluded grid theorem
• Graph searching and a min-max theorem for tree-width
• Quickly excluding a planar graph
• Spanning trees with many leaves

This page was built for publication: Tree-width and planar minors