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

08/28/2018
by   Esther Galby, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset