Proper circular arc graphs as intersection graphs of paths on a grid
Computational Geometry
2018-08-29 v1
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).
Cite
@article{arxiv.1808.09344,
title = {Proper circular arc graphs as intersection graphs of paths on a grid},
author = {Esther Galby and Maria Pia Mazzoleni and Bernard Ries},
journal= {arXiv preprint arXiv:1808.09344},
year = {2018}
}