{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:13:22Z","timestamp":1716347602405},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0012-365x(03)00137-7","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"319-327","source":"Crossref","is-referenced-by-count":2,"title":["The smallest degree sum that yields potentially kC\u2113-graphic sequences"],"prefix":"10.1016","volume":"270","author":[{"given":"Jian-Hua","family":"Yin","sequence":"first","affiliation":[]},{"given":"Jiong-Sheng","family":"Li","sequence":"additional","affiliation":[]},{"given":"Guo-Liang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00137-7_BIB1","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/S0012-365X(03)00137-7_BIB2","unstructured":"P. Erd\u0151s, M.S. Jacobson, J. Lehel, Graphs realizing the same degree sequences and their respective clique numbers, in: Y. Alavi, G. Chartrand, O.R. Oellermann, A.J. Schwenck (Eds.), Graph Theory, Combinatorics and Applications, Vol. 1, Wiley, New York, 1991, pp. 439\u2013449."},{"key":"10.1016\/S0012-365X(03)00137-7_BIB3","unstructured":"R.J. Gould, M.S. Jacobson, J. Lehel, Potentially G-graphic degree sequences, in: Y. Alavi, et al. (Eds.), Combinatorics, Graph Theory, and Algorithms, Vol. 1, New Issues Press, Kalamazoo, MI, 1999, pp. 387\u2013400."},{"key":"10.1016\/S0012-365X(03)00137-7_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","article-title":"Algorithm for constructing graphs and digraphs with given valences and factors","volume":"6","author":"Kleitman","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00137-7_BIB5","first-page":"1","article-title":"Potentially 3C\u2113-graphic sequences","volume":"29","author":"Li","year":"1999","journal-title":"J. Univ. Sci. Tech. China"},{"key":"10.1016\/S0012-365X(03)00137-7_BIB6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/(SICI)1097-0118(199810)29:2<63::AID-JGT2>3.0.CO;2-A","article-title":"The smallest degree sum that yields potentially Pk-graphic sequences","volume":"29","author":"Li","year":"1998","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00137-7_BIB7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/BF02879940","article-title":"The Erd\u00f6s\u2013Jacobson\u2013Lehel conjecture on potentially Pk-graphic sequences is true","volume":"41","author":"Li","year":"1998","journal-title":"Sci. China, Ser. A"},{"key":"10.1016\/S0012-365X(03)00137-7_BIB8","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s100120100006","article-title":"A variation of an extremal theorem due to Woodall","volume":"25","author":"Li","year":"2001","journal-title":"Southeast Asian Bull. Math."},{"key":"10.1016\/S0012-365X(03)00137-7_BIB9","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1112\/plms\/s3-24.4.739","article-title":"Sufficient conditions for circuits in graphs","volume":"24","author":"Woodall","year":"1972","journal-title":"Proc. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:25:57Z","timestamp":1553073957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X03001377"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00137-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}