Self-clique Helly circular-arc graphs
Año: 2006 vol. 306 p. 595 - 597
A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is theintersection 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.