1. N. Alon, An extremal problem for sets with applications to graph theory,J. Combinatorial Theory (A),40 (1985), 82–89.
2. D. de Caen, D. A. Gregory andN. J. Pullman, Clique coverings of complements of paths and cycles,Annals of Discrete Math, to appear.
3. P. Duchet,Représentations, noyaux en théorie des graphes et hypergraphes, Thése de doctoral d’Etat, Université Paris VI (1979).
4. P. Erdős, A. W. Goodman andL. Pósa, The representation of a graph by set intersections,Can. J. Math. 18 (1966), 106–112.
5. P. Frankl, Covering graphs by equivalence relations,Annals of Discrete Math. 12 (1982), 125–127.