Title of article
Partial Characterizations of Circular-Arc Graphs
Author/Authors
Bonomo، نويسنده , , F. and Durلn، نويسنده , , G. and Grippo، نويسنده , , L.N. and Safe، نويسنده , , M.D.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
45
To page
50
Abstract
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 the following classes: diamond-free graphs, P4-free graphs, paw-free graphs, and claw-free chordal graphs.
Keywords
Cographs , paw-free graphs , claw-free chordal , Circular-arc graphs , diamond-free graphs
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454810
Link To Document