Duality Theorems for Blocks and Tangles in Graphs
From MaRDI portal
Publication:5275442
DOI10.1137/16M1077763zbMath1366.05103arXiv1605.09139OpenAlexW2732394870MaRDI QIDQ5275442
Reinhard Diestel, Joshua Erde, Philipp Eberenz
Publication date: 14 July 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09139
Related Items (9)
Refining a Tree-Decomposition which Distinguishes Tangles ⋮ Abstract separation systems ⋮ Tree sets ⋮ Trees of tangles in infinite separation systems ⋮ Tangle-tree duality in abstract separation systems ⋮ On the Block Number of Graphs ⋮ Trees of tangles in abstract separation systems ⋮ A unified treatment of linked and lean tree-decompositions ⋮ Structural submodularity and tangles in abstract separation systems
Cites Work
- Canonical tree-decompositions of a graph that display its \(k\)-blocks
- Connectivity and tree structure in finite graphs
- Graph minors. X: Obstructions to tree-decomposition
- Über n-fach zusammenhängende Eckenmengen in Graphen
- Tangle-tree duality: in graphs, matroids and beyond
- Abstract separation systems
- Profiles of separations: in graphs, matroids, and beyond
- Graph Theory
- Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
- $k$-Blocks: A Connectivity Invariant for Graphs
This page was built for publication: Duality Theorems for Blocks and Tangles in Graphs
