{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:08:19Z","timestamp":1648807699698},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00373-011-1061-y","type":"journal-article","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T04:20:50Z","timestamp":1307420450000},"page":"585-595","source":"Crossref","is-referenced-by-count":1,"title":["The Characterization for a Graphic Sequence to have a Realization Containing K 1,1,s"],"prefix":"10.1007","volume":"28","author":[{"given":"Jian-Hua","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"key":"1061_CR1","first-page":"21","volume":"37","author":"G. Chen","year":"2007","unstructured":"Chen G.: A note on potentially K 1,1,t -graphic sequences. Australas. J. Combin. 37, 21\u201326 (2007)","journal-title":"Australas. J. Combin."},{"key":"1061_CR2","first-page":"264","volume":"11","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s P., Gallai T.: Graphs with given degrees of vertices. Math. Lapok. 11, 264\u2013274 (1960)","journal-title":"Math. Lapok."},{"key":"1061_CR3","first-page":"439","volume-title":"Graph Theory, Combinatorics and Applications, vol. 1","author":"P. Erd\u00f6s","year":"1991","unstructured":"Erd\u00f6s P., Jacobson M.S., Lehel J. et\u00a0al.: Graphs realizing the same degree sequences and their respective clique numbers. In: Alavi, Y. (ed.) Graph Theory, Combinatorics and Applications, vol. 1, pp. 439\u2013449. Wiley, New York (1991)"},{"key":"1061_CR4","first-page":"59","volume":"29","author":"E.M. Eschen","year":"2004","unstructured":"Eschen E.M., Niu J.B.: On potentially K 4 \u2212 e-graphic sequences. Australas. J. Combin. 29, 59\u201365 (2004)","journal-title":"Australas. J. Combin."},{"key":"1061_CR5","first-page":"451","volume-title":"Combinatorics, Graph Theory, and Algorithms, vol. 1","author":"R.J. Gould","year":"1999","unstructured":"Gould R.J., Jacobson M.S., Lehel J. et\u00a0al.: Potentially G-graphical degree sequences. In: Alavi, Y. (ed.) Combinatorics, Graph Theory, and Algorithms, vol. 1, pp. 451\u2013460. New Issues Press, Kalamazoo Michigan (1999)"},{"key":"1061_CR6","unstructured":"Hu, L.L., Lai, C.H.: On potentially K 5 \u2212 E 3-graphic sequences. Ars Combin. (2011, to appear)"},{"key":"1061_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","volume":"6","author":"D.J. Kleitman","year":"1973","unstructured":"Kleitman D.J., Wang D.L.: Algorithm for constructing graphs and digraphs with given valences and factors. Discrete Math. 6, 79\u201388 (1973)","journal-title":"Discrete Math."},{"key":"1061_CR8","first-page":"123","volume":"24","author":"C.H. Lai","year":"2001","unstructured":"Lai C.H.: A note on potentially K 4 \u2212 e-graphical sequences. Australas. J. Combin. 24, 123\u2013127 (2001)","journal-title":"Australas. J. Combin."},{"key":"1061_CR9","first-page":"75","volume":"7","author":"C.H. Lai","year":"2005","unstructured":"Lai C.H.: An extremal problem on potentially K p,1,1-graphic sequences. Discrete Math. Theor. Comput. Sci. 7, 75\u201381 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1061_CR10","unstructured":"Nash-Williams, C. St. J.A.: Valency sequences which force graphs to have hamiltonian circuits. Interim report, University of Waterloo, Waterloo (1970)"},{"key":"1061_CR11","unstructured":"Yin, J.H., Li, J.S., Li, W.Y.: Potentially K 1,1,t -graphic sequences. Ars Combin. (2011, to appear)"},{"key":"1061_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0012-365X(02)00765-3","volume":"26","author":"J.H. Yin","year":"2003","unstructured":"Yin J.H., Li J.S.: An extremal problem on potentially K r,s -graphic sequences. Discrete Math. 26, 295\u2013305 (2003)","journal-title":"Discrete Math."},{"key":"1061_CR13","first-page":"213","volume":"74","author":"J.H. Yin","year":"2005","unstructured":"Yin J.H., Li J.S., Chen G.L.: The smallest degree sum that yields potentially K 2,s -graphic sequences. Ars Combin. 74, 213\u2013222 (2005)","journal-title":"Ars Combin."},{"key":"1061_CR14","unstructured":"Yin, M.X., Yin, J.H., Zhong, C., Yang, F.: On the characterization of potentially K 1,1,s -graphic sequences. Util. Math. (2011, to appear)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1061-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1061-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1061-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:33Z","timestamp":1559055513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1061-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1061"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1061-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,8]]}}}