Methods for the graph realization problem

[1] T. M. Barnes, C. D. Savage, E cient generation of graphical partitions, Discrete Appl. Math. 78, 1-3 (1997) 17–26. ⇒269 Search in Google Scholar

[2] G. Chartrand, O. R. Oellermann: Applied and Algorithmic Graph Theory, McGraww-Hill, Inc.1993. ⇒269 Search in Google Scholar

[3] C. I. Del Genio, H. Kim, Z. Toroczkai, K.E. Bassler, E cient and exact sampling of simple graphs with given arbitrary degree sequence. PLoS ONE 5,4 (2010) e10012. doi:10.1371/journal.pone.0010012 ⇒269 Search in Google Scholar

[4] J. Edmonds, R. M. Karp, Theoretical improvements in algorithmic efficiency for network flow problems, Journal of the ACM 19, 2 (1972) 248–264. ⇒282 Search in Google Scholar

[5] P. Erdős, T. Gallai, Gráfok előírt fokszámú pontokkal, Matematikai Lapok (in Hungarian), 11 (1960) 264–274. ⇒268, 269, 270, 285 Search in Google Scholar

[6] P. L. Erdős, I. Miklós: A simple Havel–Hakimi type algorithm to realize graphical degree sequences of directed graphs, The Electronic Journal of Combinatorics 17 (2010) #R66 ⇒269 Search in Google Scholar

[7] S. L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph I, Journal of the Society for Industrial and Applied Mathematics, 10 (1962) 496–506. ⇒268, 269 Search in Google Scholar

[8] V. Havel, A remark on the existence of finite graphs,Časopis pro pěstování matematiky (in Czech), 80 (1955) 477–480. ⇒268, 269 Search in Google Scholar

[9] A. Iványi, L. Lucz, T. F. Móri, P. Sótér: On Erdős–Gallai and Havel–Hakimi algorithms, Acta Universitatis Sapientiae, Informatica, 3,, (2011) 230–268. ⇒268, 269, 271, 277, 278 Search in Google Scholar

[10] Z. Kása, On scattered subword complexity, Acta Universitatis Sapientiae, Informatica, 3, 1 (2011) 127–136. ⇒291 Search in Google Scholar

[11] H. Kim, C. I. Del Genio, K. E. Bassler, Z. Toroczkai, Constructing and sampling directed graphs with given degree sequences, New Journal of Physics 14 (2012) 023012 (23pp) ⇒268 Search in Google Scholar

[12] H. Kim, Z. Toroczkai, P. L. Erdős, I. Miklós, L. A. Székely, Degree-based graph construction, Journal of Physics A: Mathematical and Theoretical, Volume 42, Number 39. ⇒268 Search in Google Scholar

[13] Kleitman, D. J.; Wang, D. L, Algorithms for constructing graphs and di-graphs with given valences and factors, Discrete Mathematics, 6, 1 (1973) 79–88. doi:10.1016/0012-365x(73)90037-x ⇒268, 270 Search in Google Scholar

[14] A. Kohnert, Dominance order and graphical partitions, Elec. J. Comb. 11, 1 (2004) No. 4. 17 pp. ⇒269 Search in Google Scholar

[15] V. M. Malhotra, M. P. Kumar, S. N. Maheshwari, An O(|V|³) algorithm for finding maximum flows in networks, Information Processing Letters, 7, 6 (1978) 277–278. ⇒283 Search in Google Scholar

[16] M. Mihail, N. Vishnoi, On Generating Graphs with Prescribed Vertex Degrees for Complex Network Modeling, Semantic Scolar, Published 2003 Corpus ID: 52064211 ⇒280 Search in Google Scholar

[17] G. L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1988. ⇒276 Search in Google Scholar

[18] F. Ruskey, R. Cohen, P. Eades, A. Scott, Alley CAT’s in search of good homes, Congr. Numer. 102 (1994) 97–110. ⇒269 Search in Google Scholar

[19] A. Tripathi, H. Tyagi, A simple criterion on degree sequences of graphs, Discrete Applied Mathematics 156 (2008) 3513–3517. ⇒269 Search in Google Scholar

[20] A. Tripathi, S. Venugopalanb, D. B. West, A short constructive proof of the Erdös-Gallai characterization of graphic lists, Discrete Math. 310, 4 (2010) 833–834. ⇒269 Search in Google Scholar

[21] L. A. Wolsey, Integer Programming, John Wiley & Sons, 1998. ⇒276 Search in Google Scholar