Tree-width of graphs without a \(3\times 3\) grid minor

DOI10.1016/j.dam.2008.08.003zbMath1231.05243OpenAlexW2028974574MaRDI QIDQ967302

J. A. Bondy, Bruce A. Reed, Etienne Birmelé

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.08.003

zbMATH Keywords

gridtree-width

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Distance in graphs (05C12)

Related Items (3)

Unnamed Item ⋮ Grid minors in damaged grids ⋮ On the hyperbolicity constant in graph minors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. V. Excluding a planar graph
• Highly connected sets and the excluded grid theorem
• Applications of Menger's graph theorem
• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
• Tree-width and circumference of graphs

This page was built for publication: Tree-width of graphs without a \(3\times 3\) grid minor