On the Existence of Critical Clique-Helly Graphs

dc.contributorBassino, Frédérique
dc.contributorBonomo, Flavia
dc.contributorPournin, Lionel
dc.contributorValencia Pabon, Mario
dc.contributorVera Lizcano, Juan Carlos
dc.creatorAlcón, Liliana Graciela
dc.creatorPizaña, Miguel
dc.creatorRavenna, Gabriela Susana
dc.date.accessioned2021-09-20T20:53:42Z
dc.date.accessioned2022-10-15T09:40:18Z
dc.date.available2021-09-20T20:53:42Z
dc.date.available2022-10-15T09:40:18Z
dc.date.created2021-09-20T20:53:42Z
dc.date.issued2017
dc.identifierOn the Existence of Critical Clique-Helly Graphs; LAGOS'17 – IX Latin and American Algorithms, Graphs and Optimization Symposium; Marsella; Francia; 2017; 231-236
dc.identifier1571-0653
dc.identifierhttp://hdl.handle.net/11336/140936
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4371465
dc.description.abstractA graph is clique-Helly if any family of pairwise intersecting (maximal) cliques has non-empty total intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it as a clique-Helly graph. We present here an infinite family of counterexamples to this conjecture
dc.languageeng
dc.publisherElsevier
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S1571065317302792
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1016/j.endm.2017.10.040
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/openAccess
dc.sourceElectronic Notes in Discrete Mathematics
dc.subjectHelly property
dc.subjectclique-Helly graphs
dc.subjectclique graphs
dc.titleOn the Existence of Critical Clique-Helly Graphs
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.typeinfo:ar-repo/semantics/documento de conferencia


Este ítem pertenece a la siguiente institución