Berger, A. and Müller-Hannemann, M. (2010) Uniform sampling of digraphs with a fixed degree sequence. In Graph Theoretic Concepts in Computer Science, Vol. 6410 of Lecture Notes in Computer Science, Springer, pp. 220–231.
Bereg, S. and Ito, H. (2008) Transforming graphs with the same degree sequence. In KyotoCGGT 2007, LNCS 4535 (H. Ito et al., eds), pp. 25–32.
Erdős, P. and Gallai, T. (1960) Graphs with prescribed degree of vertices (in Hungarian). Mat. Lapok 11 264–274.
Erdős, P. L., Miklós, I. and Toroczkai, Z. (2010) A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs. Electron. J. Combin. 17 #R66.
Fulkerson, D. R. (1960) Zero-one matrices with zero trace. Pacific J. Math. 10 831–836.
Gale, D. (1957) A theorem on flows in networks, Pacific J. Math. 7 1073–1082.
Greenhill, C. (2011) A polynomial bound on the mixing time of a Markov chain for sampling regular directed graphs. Electron. J. Combin. 18 #P234.
Hakimi, S. L. (1962) On the realizability of a set of integers as degrees of the vertices of a simple graph. SIAM J. Appl. Math. 10 496–506.
Hakimi, S. L. (1965) On the degrees of the vertices of a directed graph. J. Franklin Institute 279 290–308.
Havel, V. (1955) A remark on the existence of finite graphs (in Czech). Časopis Pěst. Mat. 80 477–480.
Kim, H., Toroczkai, Z., Erdős, P. L., Miklós, I. and Székely, L. A. (2009) Degree-based graph construction. J. Phys. A: Math. Theor. 42 392001.
Király, Z. (2012) Recognizing graphic degree sequences and generating all realizations. EGRES Technical Report TR-2011-11. http://www.cs.elte.hu/egres
Kleitman, D. J. and Wang, D. L. (1973) Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Math. 6 79–88.
Kundu, S. (1973) The k-factor conjecture is true. Discrete Math. 6 367–376.
LaMar, M. D. (2011) Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence. In ACM & IEEE & SCS Proc. 2011 Winter Simulation Conference (Jain, S., Creasey, R. R.et al., eds), pp. 1–12.
Petersen, J. (1891) Die Theorie der regulären Graphen. Acta Math. 15 193–220.
Ryser, H. J. (1957) Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9 371–377.
Senior, J. K. (1951) Partitions and their representative graphs. Amer. J. Math. 73 663–689.
Tutte, W. T. (1952) The factors of graphs. Canad. J. Math. 4 314–328.
Tutte, W. T. (1954) A short proof of the factors theorem for finite graphs. Canad. J. Math. 6 347–352.
West, D. B. (2001) Introduction to Graph Theory, second edition, Prentice Hall.