scientific article; zbMATH DE number 1870231

zbMath1018.05081MaRDI QIDQ4792909

Reinhard Diestel, Patrick Bellenbaum

Publication date: 4 September 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linked tree-decompositionstheorem of Thomastreewidth duality theorem

Mathematics Subject Classification ID

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

Related Items (23)

Constructing Brambles ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ Sparse obstructions for minor-covering parameters ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Approximating Pathwidth for Graphs of Small Treewidth ⋮ The mixed search game against an agile and visible fugitive is monotone ⋮ On strict brambles ⋮ Parameters Tied to Treewidth ⋮ Tangle and Maximal Ideal ⋮ On the Block Number of Graphs ⋮ Treewidth lower bounds with brambles ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Minimum Bisection Is Fixed-Parameter Tractable ⋮ A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ Treewidth computations. II. Lower bounds ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ Connected tree-width ⋮ Directed Path-Decompositions ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Brambles and independent packings in chordal graphs ⋮ Tree decompositions and social graphs

This page was built for publication: