B. Bollob´as, Degree sequences of random graphs, Discrete Math. 33 (1981) 1-19.
 H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat. 23 (1952) 493-509.
 P. Erd¨os and R.J. Wilson, On the chromatic index of almost all graphs, J. Combinatorial Theory Ser. B 23 (1977) 255-257.
 K. Weber, Random graphs - a survey, Rostock. Math. Kolloq. 21 (1982) 83-98.
 D.R. Woodall, The binding number of a graph and its Anderson number, J. Combinatorial Theory Ser. B 15 (1973) 225-255.
The information is available from the following content providers: