Partial characterizations of circular-arc graphs

  title={Partial characterizations of circular-arc graphs},
  author={Flavia Bonomo and Guillermo Dur{\'a}n and Luciano N. Grippo and Mart{\'i}n Dar{\'i}o Safe},
  journal={Journal of Graph Theory},
A circular-arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular-arc graphs by a list of minimal forbidden induced subgraphs when the graph belongs to any of the following classes: P4-free graphs, paw-free graphs, claw-free chordal graphs and diamond-free graphs. c © X John Wiley & Sons, Inc. 
Highly Cited
This paper has 23 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 13 extracted citations


Publications referenced by this paper.
Showing 1-10 of 20 references

K4 − e)-free graphs and star cutsets

  • M. Conforti
  • Lect. Notes Math., 1403:236–253
  • 1989
1 Excerpt

Paw-free graphs

  • S. Olariu
  • Inf. Process. Lett., 28:53–54
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…