Graph minor hierarchies

DOI10.1016/j.dam.2004.01.010zbMath1055.05140OpenAlexW2073734137WikidataQ29010734 ScholiaQ29010734MaRDI QIDQ1764803

Reinhard Diestel, Daniela Kühn

Publication date: 22 February 2005

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

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

zbMATH Keywords

DecompositionTree-widthHierarchyGraph minorsGrid-width

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items (7)

Clustered 3-colouring graphs of bounded degree ⋮ The micro-world of cographs ⋮ Layered separators in minor-closed graph classes with applications ⋮ Local 2-separators ⋮ Arkhipov's theorem, graph minors, and linear system nonlocal games ⋮ Growth constants of minor-closed classes of graphs ⋮ On tree-partition-width

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors. I. Excluding a forest
• Graph minors. V. Excluding a planar graph
• Highly connected sets and the excluded grid theorem
• Relating subsets of a poset, and a partition theorem for WQOs
• Cycles of even length in graphs
• Graph Minors I: A Short Proof of the Path-width Theorem

This page was built for publication: Graph minor hierarchies