Characterising 4-tangles through a connectivity property

DOI10.37236/12367MaRDI QIDQ6925687zbMATH OpenFDO

Authors Johannes Carmesin, Jan Kurkofka

Publication date 25 September 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/12367

zbMATH Keywords

internally 4-connected graphs

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph minors (05C83)

Cites work

• A short proof that every finite graph has a tree-decomposition displaying its tangles
• Abstract separation systems
• Canonical decompositions of 3-connected graphs
• Canonical tree-decompositions of a graph that display its k-blocks
• Canonical tree-decompositions of finite graphs. I: Existence and algorithms.
• Canonical tree-decompositions of finite graphs. II. Essential parts
• Computing with tangles
• Connectivity and tree structure in finite graphs
• Efficiently distinguishing all tangles in locally finite graphs
• Ends and tangles
• Entanglements
• Graph minors. X: Obstructions to tree-decomposition
• scientific article; zbMATH DE number 1057879 (Why is no real title available?)
• Profiles of separations: in graphs, matroids, and beyond
• Quasi-4-Connected Components
• Refining a tree-decomposition which distinguishes tangles
• Refining trees of tangles in abstract separation systems: inessential parts
• Structural submodularity and tangles in abstract separation systems
• Tangle-tree duality in abstract separation systems
• Tangles and connectivity in graphs
• Tangles, tree-decompositions and grids in matroids
• Tree sets
• Trees of tangles in abstract separation systems
• Trees of tangles in infinite separation systems
• What is a 4-connected matroid?

This page was built for publication: Characterising 4-tangles through a connectivity property

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