Canonical tree-decompositions of a graph that display its \(k\)-blocks

DOI10.1016/J.JCTB.2016.05.001zbMath1350.05133arXiv1506.02904OpenAlexW2249808233MaRDI QIDQ345066

J. Pascal Gollin, Johannes Carmesin

Publication date: 25 November 2016

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

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

zbMATH Keywords

profileconnectivitytangle\(k\)-blocktree-decomposition

Mathematics Subject Classification ID

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

Related Items (7)

Duality Theorems for Blocks and Tangles in Graphs ⋮ Canonical trees of tree-decompositions ⋮ Local 2-separators ⋮ Entanglements ⋮ On the Block Number of Graphs ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ Structural submodularity and tangles in abstract separation systems

Cites Work

• Unnamed Item
• Canonical tree-decompositions of finite graphs. II. Essential parts
• 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

This page was built for publication: Canonical tree-decompositions of a graph that display its \(k\)-blocks