Two infinite families of critical clique-Helly graphs

dc.creatorAlcón, Liliana Graciela
dc.creatorPizaña, Miguel A.
dc.creatorRavenna, Gabriela Susana
dc.date2020
dc.date2021-09-16T13:50:29Z
dc.date.accessioned2023-07-15T03:14:18Z
dc.date.available2023-07-15T03:14:18Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/124932
dc.identifierissn:0166-218x
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7464951
dc.descriptionA graph is clique–Helly if every 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 two infinite families of counterexamples to this conjecture.
dc.descriptionInstituto de Física La Plata
dc.formatapplication/pdf
dc.format2-5
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by/4.0/
dc.rightsCreative Commons Attribution 4.0 International (CC BY 4.0)
dc.subjectCiencias Exactas
dc.subjectFísica
dc.subjectHelly property
dc.subjectClique-Helly graphs
dc.subjectClique graphs
dc.titleTwo infinite families of critical clique-Helly graphs
dc.typeArticulo
dc.typeArticulo


Este ítem pertenece a la siguiente institución