M. D. Barrus, S. G. Hartke, K. F. Jao, D. B. West, and S. A. Choudum, Length thresholds for graphic lists given fixed largest and smallest entries and bounded gaps A simple proof of the Erd? os-Gallai theorem on graph sequences, CM] Grant Cairns and Stacey Mendan. An improvement of a result of Zverovich?Zverovich. Ars Math. Contemp., to appear. [CMN] Grant Cairns, Stacey Mendan, and Yuri Nikolayevsky. A sharp refinement of a result of Zverovich? Zverovich. Discrete Math, pp.1494-150167, 1986.

G. Cairns, S. Mendan, and Y. Nikolayevsky, A sharp refinement of a result of Alon, Ben- Shimon and Krivelevich on bipartite graph vertex sequences, Australas. J. Combin, vol.60, issue.2, pp.217-226, 2014.

R. Diestel, Graph theory, Gal57] David Gale. A theorem on flows in networks, pp.1073-1082, 1957.

R. Hammack, W. Imrich, and S. Klav?ar, Handbook of product graphs Boca Raton, FL, second edition Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Mathematics and its ApplicationsBoca Raton Discrete Math, vol.6, pp.79-88, 1973.

D. Meierling and L. Volkmann, A remark on degree sequences of multigraphs, Mathematical Methods of Operations Research, vol.6, issue.12???19, pp.369-374, 2009.
DOI : 10.1007/s00186-008-0265-2

H. J. Ryser, Combinatorial properties of matrices of zeros and ones. Canad, J. Math, vol.9, pp.371-377, 1957.

A. Tripathi and H. Tyagi, A simple criterion on degree sequences of graphs, Discrete Applied Mathematics, vol.156, issue.18, pp.3513-3517, 2008.
DOI : 10.1016/j.dam.2008.03.033

A. Tripathi and S. Vijay, Jian-Hua Yin. Conditions for r-graphic sequences to be potentially K (r) m+1 -graphic, Erd? os & Gallai. Discrete Math. Discrete Math, vol.265, issue.30921, pp.417-4206271, 2003.

J. Jian-hua-yin and . Li, Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size, Discrete Math, vol.301, issue.2-3, pp.218-227, 2005.