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.Instituto de Física La Plata