Liliana Alcón

Learn More
The clique graph of G, K(G), is the intersection graph of the family of cliques (maximal complete sets) of G. Clique-critical graphs were defined as those whose clique graph changes whenever a vertex is removed. We prove that if G has m edges then any clique-critical graph in K −1 (G) has at most 2m vertices, which solves a question posed by Escalante and(More)