On planar graphs with large tree-width and small grid minors

DOI10.1016/j.endm.2009.02.006zbMath1267.05086OpenAlexW2088201842MaRDI QIDQ2839208

Bert Marchal, Natalya Usotskaya, Alexander Grigoriev

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.02.006

zbMATH Keywords

planar graphstree decompositiontree-widthgrid minor

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (5)

Unnamed Item ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ A note on planar graphs with large width parameters and small grid-minors ⋮ On the hyperbolicity constant in graph minors ⋮ A branch-and-price-and-cut method for computing an optimal bramble

Cites Work

• Unnamed Item
• Treewidth lower bounds with brambles
• Graph minors. X: Obstructions to tree-decomposition
• Call routing and the ratcatcher
• Quickly excluding a planar graph
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: On planar graphs with large tree-width and small grid minors