1. On the difference between clique numbers of a graph.;Cacceta;Ars Combinatoria,1985
2. On a combinatorial problem.;De Bruijn;Indag. Math.,1948
3. The representation of a graph by set intersections.;Erdós;Canad. J. Math.,1966
4. D.A. Gregory, S. McGuinness and W. Wallis, Clique partitions of the cocktail party graph, preprint (Queens University, Kingston, Ontario, Canada K7L 3N6).
5. On a clique covering problem of Orlin.;Gregory;Discrete Math.,1982