Proper circular arc graphs as intersection graphs of paths on a grid
classification
💻 cs.CG
keywords
graphscirculargridintersectionpathsproperbendcharacterisation
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.