4Li Jiongsheng,Song Zixia,Luo Rong. The Erd?s-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true[J] 1998,Science in China Series A: Mathematics(5):510～520
二级参考文献22
1[1]Gould R J,Jacobson M S,Lehel J. Potentially G-graphic degree sequences[A].Alavi Y,Lick Z,Schwenk A J.Combinatorics, Graph Theory, and Algorithms[C].Kalamazoo Michigan: New Issues Press,1999,1:387.
2[2]Erdos P,Jacobson M S,Lehel J.Graphs realizing the same degree sequences and their respective clique numbers[A].Alavi Y,Chartrand G,Oellermann O R,et al.Graph Theory, Combinatorics and Applications[C].New York: John Wiley & Sons,1991,(1):439.
3[3]Li J S,Song Z X.An extremal problem on the potentially Pk-graphic sequence[J].Discrete Math,2000,212:223.
4[4]Li J S,Song Z X.The smallest degree sum that yields potentially Pk-graphic sequences[J].J Graph Theory,1998,29:63.
5[5]Li J S,Song Z X,Luo R.The Erdos-Jacobson-Lehel conjecture on potentially Pk-graphic sequences is true[J].Science in China(A),1998,41:510.
6[6]Erdos P,Gallai T.Graphs with given degree of vertices[J].Math Lapok,1960,11:264.
7[7]Kleitman D J,Wang D L.Algorithm for constructing graphs and digraphs with given valences and factors[J].Discrete Math,1973,6:79.
8[8]Rao A R.An Erdos-Gallai type result on the clique number of a realization of a degree sequence.unpublished.
9[9]Kézdy A E,Lehel J.Degree sequences of graphs with prescribed clique size[A].Alavi Y,Lick Z,Schwenk A J.Combinatorics, Graph Theory, and Algorithms[C].Kalamazoo Michigan:New Issues Press,1999,2:535.
