3 papers
math.CO2025
Locally interval graphs are circular-arc graphs
Tara Abrishami, Sandra Albrechtsen, Nathan Bowler +2
Circular-arc graphs are graphs that can be represented as intersection graphs of subpaths of a cycle. Interval graphs are graphs that can be represented as intersection graphs of s…
math.CO2025
Displaying prescribed sets of ends by linked tree-decompositions
Sandra Albrechtsen, Max Pitz, Roman Schaut
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-decompositi…
math.CO2024
On vertex sets inducing tangles
Sandra Albrechtsen, Hanno von Bergen, Raphael W. Jacobs +2
Diestel, Hundertmark and Lemanczyk asked whether every -tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is boun…