1. Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices (in Hungarian). Mat. Lapok, 11, 264–274 (1960)
2. Fulkerson, D. R., Hoffman, A. J., McAndrew, M. H.: Some properties of graphs with multiple edges. Canad. J. Math., 17, 166–177 (1965)
3. Gould, R. J., Jacobson, M. S., Lehel, J.: Potentially G-graphical degree sequences. In: Combinatorics, Graph Theory and Algorithms (Y. Alavi et al. Ed.), Vol. 1, New Issues Press, Kalamazoo Michigan, 1999, 451–460
4. Kézdy, A. E., Lehel, J.: Degree sequences of graphs with prescribed clique size. In: Combinatorics, Graph Theory, and Algorithms (Y. Alavi et al., Eds.), Vol. 2, New Issues Press, Kalamazoo Michigan, 1999, 535–544
5. Lai, C. H., Hu, L. L.: Potentially K m − G-graphical sequences: A survey. Czechoslovak Math. J., 59, 1059–1075 (2009)