Title of article
Self-clique Helly circular-arc graphs
Author/Authors
Flavia Bonomo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
3
From page
595
To page
597
Abstract
A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph. A circular-arc graph is the intersection graph of a family of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. In this note, we describe all the self-clique Helly circular-arc graphs.
Keywords
Helly circular-arc graphs , Self-clique graphs
Journal title
Discrete Mathematics
Serial Year
2006
Journal title
Discrete Mathematics
Record number
948214
Link To Document