Efficiently distinguishing all tangles in locally finite graphs

DOI10.1016/J.JCTB.2024.03.004MaRDI QIDQ6500103FDOQ6500103

Authors: Raphael W. Jacobs, Paul Knappe 

Publication date: 10 May 2024

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

Recommendations

• Canonical trees of tree-decompositions
• Entanglements
• Canonical tree-decompositions of finite graphs. II. Essential parts
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• A short proof that every finite graph has a tree-decomposition displaying its tangles

zbMATH Keywords

tanglestree-decompositionstree-of-tangles theorem

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Connectivity and tree structure in finite graphs
• Graph theory
• Über die Maximalzahl fremder unendlicher Wege in Graphen
• Representations of infinite tree sets
• Canonical trees of tree-decompositions
• Menger's theorem for infinite graphs with ends
• Profiles of separations: in graphs, matroids, and beyond
• Ends and tangles
• Abstract separation systems
• Tree sets
• Characterising \(k\)-connected sets in infinite graphs

Cited In (1)

• Entanglements

This page was built for publication: Efficiently distinguishing all tangles in locally finite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500103)