[1]  Erdös P, Gallai T. Graphs with given degrees of vertices. Math Lapok, 1960, 11: 264--274

[2]  Erdös P, Jacobson M S, Lehel J. Graphs Realizing the Same Degree Sequences and Their Respective Clique
Numbers. Graph Theory, Combinatorics and Applications. New York: John Wiley & Sons, 1991: 439--449

[3]  Gould R J, Jacobson M S, Lehel J. Potentially G-graphical Degree Sequences. Combinatorics, Graph Theory, and Algorithms. Kalamazoo Michigan: New Issues Press, 1999: 451--460

[4]  Kézdy A K, Lehel J. Degree Sequences of Graphs with Prescribed Clique Size. Combinatorics, Graph Theory, and Algorithms. Kalamazoo Michigan: New Issues Press, 1999: 535--544

[5]  Kleitman D J, Wang D L. Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math, 1973, 6: 79--88

[6]  Li J S, Song Z X. An extremal problem on the potentially $P_k$-graphic sequence. Discrete Math, 2000, 212: 223--231

[7]  Li J S, Song Z X. The smallest degree sum that yields potentially P_k-graphic sequences. J Graph Theory, 1998, 
29: 63--72

[8]  Li J S, Song Z X, Luo R. The Erd\H{o}s-Jacobson-Lehel conjecture on potentially P_k-graphic sequences is true. Sci China (Ser A), 1998, 41: 510--520

[9]  Li J S, Yin J H. The threshold for the Erdös, Jacobson and Lehel conjecture to be true. Acta Math Sin Eng Ser, 2006, 22: 1133--1138

[10]  Luo R. On potentially C_k-graphic sequnces. Ars Combinatoria, 2002, 64: 301-318

[11]  Luo R, Warner M. On potentially K_k-graphic sequences. Ars Combinatoria, 2005, 75: 233-239

[12]  Rao A R. The clique number of a graph with given degree sequence. Lecture Notes Series, 1979, 4: 251--267

[13]  Rao A R. An Erd\H{o}s-Gallai type result on the clique number of a realization of a degree sequence. Unpublished

[14]  Yin J H, Li J S. Two sufficient conditions for a graphic sequence to have a realization with prescribed clique
size. Discrete Math, 2005, 301: 218--227