Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296–307.
Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311–316.
Bollobás, B. (2001) Random Graphs, 2nd edn, Cambridge University Press, Cambridge.
Cooper, C. (2004) The cores of random hypergraphs with a given degree sequence. Random Struct. Alg. 25 353–375.
Cooper, C. and Frieze, A. (2004) The size of the largest strongly connected component of a random digraph with a given degree sequence. Combin. Probab. Comput. 13 319–337.
Gut, A. (2005) Probability: A Graduate Course, Springer, New York.
Janson, S. and Luczak, M. (2007) A simple solution to the k-core problem. Random Struct. Alg. 30 50–62.
Janson, S., Luczak, T. and Ruciński, A. (2000) Random Graphs, Wiley, New York.
McKay, B. D. (1984) Asymptotics for 0–1 matrices with prescribed line sums. In Enumeration and Design (Waterloo, Ont., 1982), Academic Press, Toronto, ON, pp. 225–238.
McKay, B. D. (1985) Asymptotics for symmetric 0–1 matrices with prescribed row sums. Ars Combin. 19A 15–25.
McKay, B. D. and Wormald, N. C. (1990) Uniform generation of random regular graphs of moderate degree. J. Algorithms 11 52–67.
McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combin. 11 565–580.
McKay, B. D. and Wormald, N. C. (1991) Asymptotic enumeration by degree sequence of graphs with degrees o(n 1/2). Combinatorica 11 369–382.
Wormald, N. C. (1978) Some problems in the enumeration of labelled graphs. PhD thesis, University of Newcastle.
Wormald, N. C. (1981) The asymptotic distribution of short cycles in random regular graphs. J. Combin. Theory Ser. B 31 168–182.