info:eu-repo/semantics/publishedVersion
On the Existence of Critical Clique-Helly Graphs
Fecha
2017Registro en:
On the Existence of Critical Clique-Helly Graphs; LAGOS'17 – IX Latin and American Algorithms, Graphs and Optimization Symposium; Marsella; Francia; 2017; 231-236
1571-0653
CONICET Digital
CONICET
Autor
Alcón, Liliana Graciela
Pizaña, Miguel
Ravenna, Gabriela Susana
Resumen
A 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