5 papers
The global structure of locally chordal graphs
Tara Abrishami, Paul Knappe
A graph is locally chordal if each of its small-radius balls is chordal. In an earlier work [AKK25], the authors and Kobler proved that locally chordal graphs can be characterized…
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…
Locally chordal graphs
Tara Abrishami, Paul Knappe, Jonas Kobler
In this paper we study locally chordal graphs, i.e. graphs where every small-radius ball is chordal. We prove four characterizations of locally chordal graphs. Two are counterparts…
A structure theorem for rooted connectivity in bidirected graphs
Tara Abrishami, Nathan Bowler, Attila Joó +2
Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization…
Periodic colorings and orientations in infinite graphs
Tara Abrishami, Louis Esperet, Ugo Giocanti +3
We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph is periodic if the resulting colored or oriented gr…