{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:50:35Z","timestamp":1660373435062},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,12,1]],"date-time":"1997-12-01T00:00:00Z","timestamp":880934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[1997,12]]},"DOI":"10.1007\/bf03353011","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T07:47:53Z","timestamp":1403596073000},"page":"325-343","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Degree Sum Conditions for Hamiltonicity on k-Partite Graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael S.","family":"Jacobson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,17]]},"reference":[{"key":"BF03353011_CR1","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1002\/jgt.3190160602","volume":"16","author":"A Ainouche","year":"1992","unstructured":"Ainouche, A.: An Improvement of Fraisse\u2019s Sufficient Condition for Hamiltonian Graphs. J. Graph Theory 16, 529\u2013543 (1992)","journal-title":"J. Graph Theory"},{"key":"BF03353011_CR2","unstructured":"Ainouche, A., Schiermeyer, I.: Insertible vertices, neighborhood intersections and hamiltonicity, Preprint."},{"key":"BF03353011_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal V.: A Method in Graph Theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math"},{"key":"BF03353011_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01793008","volume":"11","author":"G Chen","year":"1995","unstructured":"Chen, G., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Hamiltonicity on Balanced k-partite Graphs. Graphs and Comb. 11, 221\u2013231 (1995)","journal-title":"Graphs and Comb"},{"key":"BF03353011_CR5","unstructured":"Chen, G., Liu, Y.: Hamiltonian Graphs with Large Neighborhood Unions. ARS. Combinatoria (to be published)"},{"key":"BF03353011_CR6","unstructured":"Chen, G., Schelp, H.R.: Hamiltonicity for K 1, r -free Graphs, J. of Graph Theory (to be published)"},{"key":"BF03353011_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G Dirac","year":"1952","unstructured":"Dirac, G.: Some theorems on abstract graphs. Proc. London Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. London Math. Soc"},{"key":"BF03353011_CR8","unstructured":"Liu, Y., Tian, F., Wu, Z.: A K-Hamiltonian-Nice Sequence, Preprint."},{"key":"BF03353011_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J Moon","year":"1963","unstructured":"Moon, J., Moser, L.: On hamiltonian bipartite graphs, Israel J. Math. 1, 163\u2013165 (1963)","journal-title":"Israel J. Math"},{"key":"BF03353011_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1990","unstructured":"Ore, O.: Note on hamiltonian circuits. Amer. Math. Monthly 67, 55 (1990)","journal-title":"Amer. Math. Monthly"},{"key":"BF03353011_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/jgt.3190120211","volume":"12\u20132","author":"CQ Zhang","year":"1988","unstructured":"Zhang, C.Q.: Hamilton Cycle in Claw-Free Graphs. J. Graph Theory 12\u20132, 209\u2013216 (1988)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353011.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03353011\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03353011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T10:52:33Z","timestamp":1558522353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03353011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,12]]}},"alternative-id":["BF03353011"],"URL":"https:\/\/doi.org\/10.1007\/bf03353011","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12]]}}}