{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:42:35Z","timestamp":1648636955741},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,1,2]],"date-time":"2016-01-02T00:00:00Z","timestamp":1451692800000},"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":[[2016,7]]},"DOI":"10.1007\/s00373-015-1669-4","type":"journal-article","created":{"date-parts":[[2016,1,2]],"date-time":"2016-01-02T07:47:56Z","timestamp":1451720876000},"page":"1329-1337","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hamilton Cycles in Implicit 2-Heavy Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Junqing","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,2]]},"reference":[{"key":"1669_CR1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(71)90019-7","volume":"1","author":"JA Bondy","year":"1971","unstructured":"Bondy, J.A.: Large cycles in graphs. Discret. Math. 1, 121\u2013132 (1971)","journal-title":"Discret. Math."},{"key":"1669_CR2","unstructured":"Bondy, J.A.: Longest paths and cycles in graphs of high degree. In: Research Report CORR 80-16. Univ. of Waterloo, Waterloo (1980)"},{"key":"1669_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"1669_CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0012-365X(96)00224-5","volume":"167\u2013168","author":"HJ Broersma","year":"1997","unstructured":"Broersma, H.J., Ryj\u00e1\u010dek, Z., Schiermeyer, I.: Dirac\u2019s minimum degree condition restricted to claws. Discret. Math. 167\u2013168, 155\u2013166 (1997)","journal-title":"Discret. Math."},{"key":"1669_CR5","first-page":"181","volume-title":"Contemporary Methods in Graph Theory","author":"HJ Broersma","year":"1990","unstructured":"Broersma, H.J., Veldman, H.J.: Restrictions on induced subgaphs ensuring hamiltonicity or pancyclicity of $$K_{1,3}$$ K 1 , 3 -free graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 181\u2013194. BI-Wiss.-Verl., Mannhein (1990)"},{"key":"1669_CR6","first-page":"109","volume":"19","author":"RJ Faudree","year":"1995","unstructured":"Faudree, R.J., Ryj\u00e1\u010dek, Z., Schiermeyer, I.: Forbidden subgraphs and cycle extendability. J. Comb. Math. Comb. Comput. 19, 109\u2013128 (1995)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1669_CR7","first-page":"82","volume":"6681","author":"H Li","year":"2011","unstructured":"Li, H., Ning, W.T., Cai, J.Q.: An implicit degree condition for cyclability in graphs, FAW-AAIM 2011. LNCS 6681, 82\u201389 (2011)","journal-title":"LNCS"},{"key":"1669_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1002\/jgt.3190030405","volume":"3","author":"DJ Oberly","year":"1979","unstructured":"Oberly, D.J., Sumner, D.P.: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. J. Graph Theory 3, 351\u2013356 (1979)","journal-title":"J. Graph Theory"},{"key":"1669_CR9","doi-asserted-by":"crossref","first-page":"6584","DOI":"10.1016\/j.disc.2007.10.048","volume":"308","author":"T Yamashita","year":"2008","unstructured":"Yamashita, T.: On degree sum conditions for long cycles and cycles through specified vertices. Discret. Math. 308, 6584\u20136587 (2008)","journal-title":"Discret. Math."},{"key":"1669_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01788680","volume":"5","author":"Y Zhu","year":"1989","unstructured":"Zhu, Y., Li, H., Deng, X.: Implicit-degrees and circumferences. Gr. Comb. 5, 283\u2013290 (1989)","journal-title":"Gr. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1669-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1669-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1669-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:42Z","timestamp":1559055582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1669-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,2]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1669"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1669-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,2]]}}}