(1)Erdös, P. and Rényi, A.On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5A (1960), 17–61.
(2)Harary, F.Graph theory (1969) Addison–Wesley.
(3)Holgate, P.Majorants of the chromatic number of a random graph. J. Roy. Statist. Soc. Ser. B 31 (1969), 303–309.
(4)Matula, D. W.On the complete subgraphs of a random graph. Proc. 2nd. Conf. Comb. Th. and Appl. (1970) Chapel Hill, 356–369.
(5)Matula, D. W., Marble, G. and Isaacson, J. D. Graph colouring algorithms, in Graph theory and computing (1972) Academic Press, London, 109–122.
(6)Welsh, D. J. A. and Powell, M. B.An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput. J. 10 (1967), 85–86.
(7)Wilf, H. S.The eigenvalues of a graph and its chromatic number. J. London Math. Soc. 42 (1967), 330–332.
(8)Wilson, R. J.Introduction to graph theory (1972) Oliver and Boyd, Edinburgh.
(9)Grimmett, G. R.Random Graph Theorems. Proc. 7th Prague Conf. on Information Theory and related topics (1974), in press.