{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:52Z","timestamp":1748404912989,"version":"3.41.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071370","12171393","12131013","12471334"],"award-info":[{"award-number":["12071370","12171393","12131013","12471334"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017596","name":"Natural Science Basic Research Program of Shaanxi Province","doi-asserted-by":"publisher","award":["2021JM-040"],"award-info":[{"award-number":["2021JM-040"]}],"id":[{"id":"10.13039\/501100017596","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shaanxi Fundamental Science Research Project for Mathematics and Physics","award":["22JSZ009"],"award-info":[{"award-number":["22JSZ009"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02871-9","type":"journal-article","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T12:38:31Z","timestamp":1735216711000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Degree Conditions for Hamiltonicity of Claw-Free Graphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Wangyi","family":"Shang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9596-0826","authenticated-orcid":false,"given":"Shenggui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Binlong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xia","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,26]]},"reference":[{"key":"2871_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0095-8956(90)90032-U","volume":"49","author":"AS Asratian","year":"1990","unstructured":"Asratian, A.S., Khachatryan, N.K.: Some localization theorems on hamiltonian circuits. J. Combin. Theory Ser. B 49, 287\u2013294 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2871_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jctb.2020.04.005","volume":"148","author":"AS Asratian","year":"2021","unstructured":"Asratian, A.S., Granholm, J.B., Khachatryan, N.K.: A localization method in hamiltonian graph theory. J. Combin. Theory Ser. B 148, 209\u2013238 (2021)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2871_CR3","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"2871_CR4","unstructured":"Broersma, H.J.: Problem 2, in: Workshop Cycles and Colourings, Novy Smokovec, Slovakia, (1993) available on http:\/\/umv.science.upjs.sk\/c&c\/history\/93problems.pdf"},{"key":"2871_CR5","doi-asserted-by":"publisher","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F Harary","year":"1965","unstructured":"Harary, F., C.St.J.A.: Nash-Williams: on Eulerian and Hamiltonian graphs and line graphs. Canada Math. Bull. 8, 701\u2013710 (1965)","journal-title":"Canada Math. Bull."},{"key":"2871_CR6","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10114-016-4686-1","volume":"32","author":"R \u010cada","year":"2016","unstructured":"\u010cada, R., Li, B., Ning, B., Zhang, S.: Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs. Acta Math. Sin. (Engl. Ser.) 32, 845\u2013855 (2016)","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"2871_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"PA Catlin","year":"1988","unstructured":"Catlin, P.A.: A reduction method to find spanning Eulerian subgraphs. J. Graph Theory 12, 29\u201344 (1988)","journal-title":"J. Graph Theory"},{"key":"2871_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.disc.2020.112165","volume":"344","author":"Z-H Chen","year":"2021","unstructured":"Chen, Z.-H.: Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. Discrete Math. 344, 112\u2013165 (2021)","journal-title":"Discrete Math."},{"key":"2871_CR9","first-page":"271","volume":"48","author":"Z-H Chen","year":"1998","unstructured":"Chen, Z.-H., Lai, H.-J.: Supereulerian graph and the Petersen graph $$\\Pi $$. Ars Combin. 48, 271\u2013282 (1998)","journal-title":"Ars Combin."},{"key":"2871_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2871_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(94)00159-7","volume":"146","author":"H-J Lai","year":"1995","unstructured":"Lai, H.-J.: Supereulerian graphs and excluded induced minors. Discrete Math. 146, 133\u2013143 (1995)","journal-title":"Discrete Math."},{"key":"2871_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/jgt.3190090208","volume":"9","author":"M Matthews","year":"1985","unstructured":"Matthews, M., Sumner, D.: Longest paths and cycles in $$K_{1,3}$$-free graphs. J. Graph Theory 9, 269\u2013277 (1985)","journal-title":"J. Graph Theory"},{"key":"2871_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z Ryj\u00e1\u010dek","year":"1997","unstructured":"Ryj\u00e1\u010dek, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217\u2013224 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2871_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(92)00063-W","volume":"124","author":"HJ Veldman","year":"1994","unstructured":"Veldman, H.J.: On dominating and spanning circuits in graphs. Discrete Math. 124, 229\u2013239 (1994)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02871-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02871-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02871-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:39Z","timestamp":1748319759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02871-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,26]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2871"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02871-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,26]]},"assertion":[{"value":"23 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"11"}}