Displaying prescribed sets of ends by linked tree-decompositions
Sandra Albrechtsen, Max Pitz, Roman Schaut

TL;DR
This paper proves that for certain graph ends, a linked tree-decomposition can display all their combinatorial properties, enhancing understanding of graph structure related to ends.
Contribution
It demonstrates that ends displayable by finite-adhesion tree-decompositions can also be displayed by linked ones, preserving all combinatorial information.
Findings
Linked tree-decompositions can display all ends with finite adhesion.
They capture degrees, dominating vertices, and combined degrees of ends.
The result improves structural understanding of graph ends.
Abstract
We show that if a subset of the ends of a graph can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial information of the ends in : their degrees, their sets of dominating vertices, and their combined degrees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Graph Labeling and Dimension Problems
