Displaying prescribed sets of ends by linked tree-decompositions
Authors
Sandra Albrechtsen, Max Pitz, Roman Schaut
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.
