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: | |
|---|---|
| Formato: | Artículo publishedVersion |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v306_n6_p595_Bonomo_oai |
| Aporte de: |
| id |
I28-R145-paper_0012365X_v306_n6_p595_Bonomo_oai |
|---|---|
| record_format |
dspace |
| spelling |
I28-R145-paper_0012365X_v306_n6_p595_Bonomo_oai2020-10-19 Bonomo, F. 2006 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. application/pdf http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar Discrete Math 2006;306(6):595-597 Helly circular-arc graphs Self-clique graphs Inclusions Helly circular-arc graphs Self-clique graphs Graph theory Self-clique Helly circular-arc graphs info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v306_n6_p595_Bonomo_oai |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-145 |
| collection |
Repositorio Digital de la Universidad de Buenos Aires (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, F. 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. |
| format |
Artículo Artículo publishedVersion |
| author |
Bonomo, F. |
| author_facet |
Bonomo, F. |
| author_sort |
Bonomo, F. |
| 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 |
http://hdl.handle.net/20.500.12110/paper_0012365X_v306_n6_p595_Bonomo http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_0012365X_v306_n6_p595_Bonomo_oai |
| work_keys_str_mv |
AT bonomof selfcliquehellycirculararcgraphs |
| _version_ |
1766026520273354752 |