Efficiently distinguishing all tangles in locally finite graphs

DOI10.1016/J.JCTB.2024.03.004MaRDI QIDQ6500103zbMATH OpenFDO

Authors Raphael W. Jacobs, Paul Knappe

Publication date 10 May 2024

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

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.03.004

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)

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

Cites work

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

Cited in

(3)

• Entanglements
• Characterising 4-tangles through a connectivity property
• Refining tree-decompositions so that they display the k-blocks

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)