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
A generalisation of Menger's theorem in bidirected graphs
Ebrahim Ghorbani, Jana Katharina Nickel, Florian Reich
Menger's theorem - the maximum number of vertex-disjoint - paths is equal to the minimum size of an - separator - is generally not true in bidirected graphs. We prove t…
math.CO2025
Disjoint -paths in bidirected graphs
Jana K. Nickel
Let be a bidirected multigraph with signing , let be a set of vertices in , and let be a non-negative integer. For any pair of vertex sets satis…