Clique graphs of packed graphs

Abstract Let | G | be the number of vertices of a graph G and ω( G ) be the density of G . We call a graph G packed if the clique graph K ( G ) of G has exactly 2 | G |−ω( G ) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3].