Refining a Tree-Decomposition which Distinguishes Tangles

DOI10.1137/16M1059539zbMath1366.05104arXiv1512.02499OpenAlexW2963736077MaRDI QIDQ5275443

Joshua Erde

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/1512.02499

zbMATH Keywords

profiletangle\(k\)-blocktree-decomposition

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (2)

Tangle-tree duality in abstract separation systems ⋮ 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
• Tangle-tree duality in abstract separation systems
• Profiles of separations: in graphs, matroids, and beyond
• Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
• Duality Theorems for Blocks and Tangles in Graphs

This page was built for publication: Refining a Tree-Decomposition which Distinguishes Tangles