A unified treatment of linked and lean tree-decompositions

DOI10.1016/j.jctb.2017.12.001zbMath1384.05132arXiv1703.03756OpenAlexW2599660984MaRDI QIDQ1745735

Joshua Erde

Publication date: 18 April 2018

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

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

zbMATH Keywords

tree-decompositionlinkedbranch-decompositionleanseparation system

Mathematics Subject Classification ID

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

Related Items (6)

\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Tangle-tree duality in abstract separation systems ⋮ A Menger-like property of tree-cut width ⋮ Directed Path-Decompositions ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms ⋮ Structural submodularity and tangles in abstract separation systems

Cites Work

• A well-quasi-order for tournaments
• Linked tree-decompositions of represented infinite matroids
• Matroid tree-width
• Addendum to matroid tree-width
• Graph minors. V. Excluding a planar graph
• A Menger-like property of tree-width: The finite case
• Upper bounds on the size of obstructions and intertwines
• Graph searching and a min-max theorem for tree-width
• Branch-width and well-quasi-ordering in matroids and graphs.
• Tournament minors
• Graph minors. IV: Tree-width and well-quasi-ordering
• Rank-Width and Well-Quasi-Ordering
• $k$-Blocks: A Connectivity Invariant for Graphs
• Duality Theorems for Blocks and Tangles in Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A unified treatment of linked and lean tree-decompositions