Bender, E. A., Richmond, L. B. and Wormald, N. C. (1985) Almost all chordal graphs split. J. Austral. Math. Soc. (A) 38 214–221.
Caccetta, L., Erdős, P., Ordman, E. and Pullman, N. (1985) The difference between the clique numbers of a graph. Ars Combinatoria 19 A 97–106.
Chartrand, G. and Lesniak, L. (1986) Graphs and Digraphs, 2nd. Edition, Wadsworth, Belmont, CA.
Chvátal, V. and Hammer, P. (1973) Set packing and threshold graphs, Univ. of Waterloo Research Report CORR 73–21.
Chvátal, V. and Hammer, P. (1977) Aggregation of inequalities in integer programming. Ann. Discrete Math 1 145–162.
DeBruijn, N. G. and Erdős, P. (1948) On a combinatorial problem. Indag. Math. 10 421–423.
Erdős, P., Faudree, R. and Ordman, E. (1988) Clique coverings and clique partitions. Discrete Mathematics 72 93–101.
Erdős, P., Goodman, A. W. and Posa, L. (1966) The representation of a graph by set intersections. Canad. J. Math. 18 106–112.
Erdős, P., Gyárfás, A., Ordman, E. T. and Zalcstein, Y. (1989) The size of chordal, interval, and threshold subgraphs. Combinatorica 9 (3) 245–253.
Golumbic, M. (1980) Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
Gregory, D. A. and Pullman, N. J. (1982) On a clique covering problem of Orlin. Discrete Math. 41 97–99.
Henderson, P. and Zalcstein, Y. (1977) A graph theoretic characterization of the PVchunk class of synchronizing primitives. SIAM J. Comp. 6 88–108.
Orlin, J. (1977) Contentment in Graph Theory: covering graphs with cliques. Indag. Math. 39 406–424.
Wallis, W. D. (1982) Asymptotic values of clique partition numbers. Combinatorica 2 (1) 99–101.