an:05023271
Zbl 1087.05042
Bonomo, Flavia
Self-clique Helly circular-arc graphs
EN
Discrete Math. 306, No. 6, 595-597 (2006).
00125100
2006
j
05C69
Summary: 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.