Self-clique Helly circular-arc graphs
2006, Discrete Mathematics 306 (6), 595-597, 2006Citas: 18
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones
Autor(es)
Flavia Bonomo
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.