$k$-Blocks: A Connectivity Invariant for Graphs

DOI10.1137/130923646zbMath1309.05170arXiv1305.4557OpenAlexW2004397231MaRDI QIDQ5246089

Reinhard Diestel, Johannes Carmesin, Matthias Hamann, Fabian Hundertmark

Publication date: 17 April 2015

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

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

zbMATH Keywords

connectivitytangletree-width\(k\)-blocktree-decompositionglobalwidth parameter

Mathematics Subject Classification ID

Graph minors (05C83) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (15)

Duality Theorems for Blocks and Tangles in Graphs ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ Connectivity and tree structure in finite graphs ⋮ Packing cycles in undirected group-labelled graphs ⋮ Canonical tree-decompositions of finite graphs. I: Existence and algorithms. ⋮ Packing \(A\)-paths of length zero modulo a prime ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Tangle-tree duality in abstract separation systems ⋮ On the Block Number of Graphs ⋮ A unified treatment of linked and lean tree-decompositions ⋮ A Menger-like property of tree-cut width ⋮ A Short Derivation of the Structure Theorem for Graphs with Excluded Topological Minors ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Canonical tree-decompositions of finite graphs. II. Essential parts

This page was built for publication: $k$-Blocks: A Connectivity Invariant for Graphs