1 research outputs found
Proper circular arc graphs as intersection graphs of paths on a grid
In this paper we present a characterisation, by an infinite family of minimal
forbidden induced subgraphs, of proper circular arc graphs which are
intersection graphs of paths on a grid, where each path has at most one bend
(turn)