{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:36Z","timestamp":1765164096346,"version":"3.46.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T00:00:00Z","timestamp":1763510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100009024","name":"Exploratory Research for Advanced Technology","doi-asserted-by":"publisher","award":["JPMJER2301"],"award-info":[{"award-number":["JPMJER2301"]}],"id":[{"id":"10.13039\/501100009024","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["JPMJSP2123"],"award-info":[{"award-number":["JPMJSP2123"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["25KJ2077"],"award-info":[{"award-number":["25KJ2077"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02992-9","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T15:28:25Z","timestamp":1763566105000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree sum conditions and a 2-factor with a bounded number of cycles in claw-free graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8710-169X","authenticated-orcid":false,"given":"Masaki","family":"Kashima","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,19]]},"reference":[{"key":"2992_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s00373-009-0855-7","volume":"25","author":"H Broersma","year":"2009","unstructured":"Broersma, H., Paulusma, D., Yoshimoto, K.: Sharp upper bounds on the number of components of 2-factors in claw-free graphs. Graphs Combin. 25, 427\u2013460 (2009)","journal-title":"Graphs Combin."},{"key":"2992_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s00373-013-1375-z","volume":"31","author":"R \u010cada","year":"2015","unstructured":"\u010cada, R., Chiba, S., Yoshimoto, K.: 2-Factors in Claw-free Graphs with Lower Bounds Cycle Lengths. Graphs Combin. 31, 99\u2013113 (2015)","journal-title":"Graphs Combin."},{"key":"2992_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1002\/jgt.3190150304","volume":"15","author":"SA Choudum","year":"1991","unstructured":"Choudum, S.A., Paulraj, M.S.: Regular factors in $$K_{1,3}$$-free graphs. J. Graph Theory 15, 259\u2013265 (1991)","journal-title":"J. Graph Theory"},{"key":"2992_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/jgt.3190150310","volume":"15","author":"Y Egawa","year":"1991","unstructured":"Egawa, Y., Ota, K.: Regular factors in $$K_{1, n}$$-free graphs. J. Graph Theory 15, 337\u2013344 (1991)","journal-title":"J. Graph Theory"},{"key":"2992_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(98)00398-7","volume":"206","author":"RJ Faudree","year":"1999","unstructured":"Faudree, R.J., Favaron, O., Flandrin, E., Li, H., Liu, Z.: On 2-factors in claw-free graphs. Discrete Math. 206, 131\u2013137 (1999)","journal-title":"Discrete Math."},{"key":"2992_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/jgt.20579","volume":"69","author":"RJ Faudree","year":"2012","unstructured":"Faudree, R.J., Magnant, C., Ozeki, K., Yoshimoto, K.: Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69, 251\u2013263 (2012)","journal-title":"J. Graph Theory"},{"key":"2992_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.7151\/dmgt.1213","volume":"24","author":"D Fron\u010dek","year":"2004","unstructured":"Fron\u010dek, D., Ryj\u00e1\u010dek, Z., Skupie\u0144, Z.: On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24, 55\u201371 (2004)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2992_CR8","first-page":"46","volume":"26","author":"RJ Gould","year":"1999","unstructured":"Gould, R.J., Hynds, E.A.: A note on cycles in 2-factors of line graphs. Bull. ICA 26, 46\u201348 (1999)","journal-title":"Bull. ICA"},{"key":"2992_CR9","unstructured":"Kashima, M.: New type degree conditions for a graph to have a 2-factor, arXiv:2503.18409"},{"key":"2992_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.disc.2011.08.020","volume":"312","author":"R Ku\u017eel","year":"2012","unstructured":"Ku\u017eel, R., Ozeki, K., Yoshimoto, K.: 2-factors and independent sets on claw-free graphs. Discrete Math. 312, 202\u2013206 (2012)","journal-title":"Discrete Math."},{"key":"2992_CR11","doi-asserted-by":"crossref","unstructured":"Harary, F., Nash-Williams, C.St.J.A.: On eulerian and hamiltonian graphs and line graphs, Canad. Math. Bull. 8 (1965), 701\u2013709","DOI":"10.4153\/CMB-1965-051-3"},{"key":"2992_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"MM Matthews","year":"1984","unstructured":"Matthews, M.M., Sumner, D.P.: Hamiltonian results in $$K_{1,3}$$-free graphs. J. Graph Theory 8, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"2992_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":"2992_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O","volume":"32","author":"Z Ryj\u00e1\u010dek","year":"1999","unstructured":"Ryj\u00e1\u010dek, Z., Saito, A., Schelp, R.H.: Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory 32, 109\u2013117 (1999)","journal-title":"J. Graph Theory"},{"key":"2992_CR15","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"Tutte, W.T.: The factors of graphs. Canadian J. Math. 4, 314\u2013328 (1952)","journal-title":"Canadian J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02992-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02992-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02992-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:24Z","timestamp":1765164024000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02992-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2992"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02992-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"11 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"131"}}