Self-clique Helly circular-arc graphs
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...
Guardado en:
| Autor principal: | |
|---|---|
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0012365X_v306_n6_p595_Bonomo http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo |
| Aporte de: |
| id |
paper:paper_0012365X_v306_n6_p595_Bonomo |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_0012365X_v306_n6_p595_Bonomo2023-06-08T14:35:22Z Self-clique Helly circular-arc graphs Bonomo, Flavia Helly circular-arc graphs Self-clique graphs Inclusions Helly circular-arc graphs Self-clique graphs Graph theory 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. © 2006 Elsevier B.V. All rights reserved. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2006 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0012365X_v306_n6_p595_Bonomo http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Helly circular-arc graphs Self-clique graphs Inclusions Helly circular-arc graphs Self-clique graphs Graph theory |
| spellingShingle |
Helly circular-arc graphs Self-clique graphs Inclusions Helly circular-arc graphs Self-clique graphs Graph theory Bonomo, Flavia Self-clique Helly circular-arc graphs |
| topic_facet |
Helly circular-arc graphs Self-clique graphs Inclusions Helly circular-arc graphs Self-clique graphs Graph theory |
| description |
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. © 2006 Elsevier B.V. All rights reserved. |
| author |
Bonomo, Flavia |
| author_facet |
Bonomo, Flavia |
| author_sort |
Bonomo, Flavia |
| title |
Self-clique Helly circular-arc graphs |
| title_short |
Self-clique Helly circular-arc graphs |
| title_full |
Self-clique Helly circular-arc graphs |
| title_fullStr |
Self-clique Helly circular-arc graphs |
| title_full_unstemmed |
Self-clique Helly circular-arc graphs |
| title_sort |
self-clique helly circular-arc graphs |
| publishDate |
2006 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0012365X_v306_n6_p595_Bonomo http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo |
| work_keys_str_mv |
AT bonomoflavia selfcliquehellycirculararcgraphs |
| _version_ |
1768542768578166784 |