Entanglements

DOI10.1016/j.jctb.2023.08.007arXiv2205.11488OpenAlexW4386698040MaRDI QIDQ6144391

Jan Kurkofka, Johannes Carmesin

Publication date: 29 January 2024

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

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

zbMATH Keywords

entanglementcanonicaltree of tanglesefficiently distinguishnested set of separations

Mathematics Subject Classification ID

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

Cites Work

• Canonical tree-decompositions of finite graphs. II. Essential parts
• Canonical tree-decompositions of a graph that display its \(k\)-blocks
• A short proof that every finite graph has a tree-decomposition displaying its tangles
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• Graph minors. X: Obstructions to tree-decomposition
• A tree-of-tangles theorem for infinite tangles
• Trees of tangles in abstract separation systems
• All graphs have tree-decompositions displaying their topological ends
• Abstract separation systems
• Tree sets
• Profiles of separations: in graphs, matroids, and beyond
• Canonical trees of tree-decompositions
• Local 2-separators
• Graph Theory

This page was built for publication: Entanglements