Connectivity and tree structure in finite graphs

DOI10.1007/s00493-014-2898-5zbMath1324.05104arXiv1105.1611OpenAlexW2069572927MaRDI QIDQ397061

Fabian Hundertmark, Reinhard Diestel, Johannes Carmesin, Maya Jakobine Stein

Publication date: 14 August 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

tree decompositiongraph connectivitygraph decomposition

Mathematics Subject Classification ID

Trees (05C05) Graph minors (05C83) Connectivity (05C40)

Related Items (18)

Duality Theorems for Blocks and Tangles in Graphs ⋮ Refining a Tree-Decomposition which Distinguishes Tangles ⋮ Canonical tree-decompositions of a graph that display its \(k\)-blocks ⋮ Canonical trees of tree-decompositions ⋮ Abstract separation systems ⋮ Vertex Cuts ⋮ Trees of tangles in infinite separation systems ⋮ Packing cycles in undirected group-labelled graphs ⋮ Canonical tree-decompositions of finite graphs. I: Existence and algorithms. ⋮ Splitting groups with cubic Cayley graphs of connectivity two ⋮ Computing Minimum k-Connected m-Fold Dominating Set in General Graphs ⋮ Tangle-tree duality in abstract separation systems ⋮ On the Block Number of Graphs ⋮ Trees of tangles in abstract separation systems ⋮ Minimum Bisection Is Fixed-Parameter Tractable ⋮ Computing with Tangles ⋮ Structural submodularity and tangles in abstract separation systems ⋮ Canonical tree-decompositions of finite graphs. II. Essential parts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Canonical tree-decompositions of finite graphs. II. Essential parts
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• Graph minors. X: Obstructions to tree-decomposition
• Über n-fach zusammenhängende Eckenmengen in Graphen
• Highly connected sets and the excluded grid theorem
• Cutting up graphs
• Vertex Cuts
• $k$-Blocks: A Connectivity Invariant for Graphs

This page was built for publication: Connectivity and tree structure in finite graphs