Optimizing the Graph Minors Weak Structure Theorem

DOI10.1137/110857027zbMath1283.05253arXiv1102.5762OpenAlexW1928357011MaRDI QIDQ2870501

Archontia C. Giannopoulou, Dimitrios M. Thilikos

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

treewidthgraph minorsweak structure theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Related Items (7)

Contraction bidimensionality of geometric intersection graphs ⋮ Forbidding Kuratowski Graphs as Immersions ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ All minor-minimal apex obstructions with connectivity two ⋮ The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs ⋮ A new proof of the flat wall theorem ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs

This page was built for publication: Optimizing the Graph Minors Weak Structure Theorem