| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903519 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Liliana Alcón, Miguel Pizaña, Gabriela Ravenna,