Proper circular arc graphs as intersection graphs of paths on a grid

Abstract

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).

References in corpus (2)

• VPG and EPG bend-numbers of Halin Graphs
• On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid