Highly Influential

- Published 2017 in Discrete Applied Mathematics
DOI:10.1016/j.dam.2016.11.004

In this paper, we have shown that a graph is a circular arc graph if and only if the corresponding symmetric digraph with loops is a circular arc digraph. We characterize circular arc digraphs and circular arc graphs using circular ordering of their edges. We also characterize a circular arc graph as a union of an interval graph and a threshold graph… CONTINUE READING

### Presentations referencing similar topics