Canonical trees of tree-decompositions

DOI10.1016/j.jctb.2021.08.004zbMath1479.05299arXiv2002.12030OpenAlexW3198631274MaRDI QIDQ2664548

Babak Miraftab, Matthias Hamann, Johannes Carmesin

Publication date: 17 November 2021

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

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

zbMATH Keywords

tanglegraph automorphismsautomorphisms-group invariant tree-decompositions

Mathematics Subject Classification ID

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

Related Items (6)

Trees of tangles in infinite separation systems ⋮ Countably determined ends and graphs ⋮ A Stallings type theorem for quasi-transitive graphs ⋮ Entanglements ⋮ Tangle-tree duality in abstract separation systems ⋮ A tree-of-tangles theorem for infinite tangles

Cites Work

• Canonical tree-decompositions of a graph that display its \(k\)-blocks
• Connectivity and tree structure in finite graphs
• Graph minors. X: Obstructions to tree-decomposition
• Lattices of cuts in graphs
• All graphs have tree-decompositions displaying their topological ends
• Profiles of separations: in graphs, matroids, and beyond
• Representations of infinite tree sets
• Graph Theory
• Vertex Cuts
• Cutting up graphs revisited – a short proof of Stallings' structure theorem

This page was built for publication: Canonical trees of tree-decompositions