1 paper
Anna M. Limbach, Martin Winter
The clique graph kG of a graph G has as its vertices the cliques (maximal complete subgraphs) of G, two of which are adjacent in kG if they have non-empty intersection in $…