info:eu-repo/semantics/article
Two infinite families of critical clique–Helly graphs
Fecha
2020-07Registro en:
Alcón, Liliana Graciela; Pizaña, Miguel; Ravenna, Gabriela Susana; Two infinite families of critical clique–Helly graphs; Elsevier Science; Discrete Applied Mathematics; 281; 7-2020; 2-5
0166-218X
CONICET Digital
CONICET
Autor
Alcón, Liliana Graciela
Pizaña, Miguel
Ravenna, Gabriela Susana
Resumen
A 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.