Canonical tree-decompositions of finite graphs. II. Essential parts

DOI10.1016/J.JCTB.2014.12.009zbMath1332.05134arXiv1305.4909OpenAlexW1616242941MaRDI QIDQ257005

Reinhard Diestel, Johannes Carmesin, Matthias Hamann, Fabian Hundertmark

Publication date: 14 March 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

minortangle\(k\)-blocktree-decomposition

Mathematics Subject Classification ID

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

Related Items (9)

Refining a Tree-Decomposition which Distinguishes Tangles ⋮ Canonical tree-decompositions of a graph that display its \(k\)-blocks ⋮ Connectivity and tree structure in finite graphs ⋮ Canonical tree-decompositions of finite graphs. I: Existence and algorithms. ⋮ Entanglements ⋮ On the Block Number of Graphs ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ Computing with Tangles ⋮ Structural submodularity and tangles in abstract separation systems

Cites Work

• Connectivity and tree structure in finite graphs
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• Graph minors. X: Obstructions to tree-decomposition
• Graph searching and a min-max theorem for tree-width
• $k$-Blocks: A Connectivity Invariant for Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Canonical tree-decompositions of finite graphs. II. Essential parts