Counterexamples regarding linked and lean tree-decompositions of infinite graphs

DOI10.1002/JGT.23279MaRDI QIDQ6913324zbMATH OpenFDO

Authors Sandra Albrechtsen, Raphael W. Jacobs, Paul Knappe, Max F. Pitz

Publication date 21 October 2025

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23279

zbMATH Keywords

counterexampleinfinite graphleanlinkedtree-decomposition

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Infinite graphs (05C63) Graph minors (05C83)

Cites work

• A Menger-like property of tree-width: The finite case
• A unified treatment of linked and lean tree-decompositions
• All graphs have tree-decompositions displaying their topological ends
• Canonical trees of tree-decompositions
• Excluding infinite clique minors
• Excluding Infinite Trees
• Graph minors. IV: Tree-width and well-quasi-ordering
• scientific article; zbMATH DE number 3566878 (Why is no real title available?)
• scientific article; zbMATH DE number 1870231 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• Menger's theorem for infinite graphs
• Some path problems in graph theory
• The Menger-like property of the three-width of infinite graphs
• Tree-partitions of infinite graphs
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor

This page was built for publication: Counterexamples regarding linked and lean tree-decompositions of infinite graphs

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