Clique graphs of packed graphs
Let \(| G|\) be the number of vertices of a graph G and \(\omega\) (G) the number of vertices in the largest clique of G. The clique graph K(G) is the intersection graph of the cliques of G. For all G, \(| K(G)| \leq 2^{| G| -\omega (G)}\) [see \textit{B. Hedman}, Discrete Math. 54, 161-166 (1986; Zbl 0569.05029)] and G is called packed if this is an equality. This paper corrects the characterization of the clique graphs of packed graphs given by Hedman.
scientific article; zbMATH DE number 3972907