On the Existence of Critical Clique-Helly Graphs
- Autores
- Alcón, Liliana Graciela; Pizaña, Miguel; Ravenna, Gabriela Susana
- Año de publicación
- 2017
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture.
Facultad de Ciencias Exactas - Materia
-
Matemática
Helly property
Clique-Helly graphs
Clique graphs - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/4.0/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/102977
Ver los metadatos del registro completo
id |
SEDICI_ae4a437b66e184dcea6751aa0e34d6fe |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/102977 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
On the Existence of Critical Clique-Helly GraphsAlcón, Liliana GracielaPizaña, MiguelRavenna, Gabriela SusanaMatemáticaHelly propertyClique-Helly graphsClique graphsA graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture.Facultad de Ciencias Exactas2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf231-236http://sedici.unlp.edu.ar/handle/10915/102977enginfo:eu-repo/semantics/altIdentifier/issn/1571-0653info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2017.10.040info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:54:29Zoai:sedici.unlp.edu.ar:10915/102977Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:54:30.082SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
On the Existence of Critical Clique-Helly Graphs |
title |
On the Existence of Critical Clique-Helly Graphs |
spellingShingle |
On the Existence of Critical Clique-Helly Graphs Alcón, Liliana Graciela Matemática Helly property Clique-Helly graphs Clique graphs |
title_short |
On the Existence of Critical Clique-Helly Graphs |
title_full |
On the Existence of Critical Clique-Helly Graphs |
title_fullStr |
On the Existence of Critical Clique-Helly Graphs |
title_full_unstemmed |
On the Existence of Critical Clique-Helly Graphs |
title_sort |
On the Existence of Critical Clique-Helly Graphs |
dc.creator.none.fl_str_mv |
Alcón, Liliana Graciela Pizaña, Miguel Ravenna, Gabriela Susana |
author |
Alcón, Liliana Graciela |
author_facet |
Alcón, Liliana Graciela Pizaña, Miguel Ravenna, Gabriela Susana |
author_role |
author |
author2 |
Pizaña, Miguel Ravenna, Gabriela Susana |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Matemática Helly property Clique-Helly graphs Clique graphs |
topic |
Matemática Helly property Clique-Helly graphs Clique graphs |
dc.description.none.fl_txt_mv |
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture. Facultad de Ciencias Exactas |
description |
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/102977 |
url |
http://sedici.unlp.edu.ar/handle/10915/102977 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/1571-0653 info:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2017.10.040 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
dc.format.none.fl_str_mv |
application/pdf 231-236 |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260431278702592 |
score |
13.13397 |