{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:16:25Z","timestamp":1760573785886,"version":"build-2065373602"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T00:00:00Z","timestamp":1755734400000},"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":["12131013"],"award-info":[{"award-number":["12131013"]}],"id":[{"id":"10.13039\/501100001809","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,10]]},"DOI":"10.1007\/s00373-025-02947-0","type":"journal-article","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T12:35:53Z","timestamp":1755779753000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Every 3-Connected Claw-Free Graph of Diameter at Most 3 has a 2-Factor with at Most Two Components"],"prefix":"10.1007","volume":"41","author":[{"given":"Lei","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3091-3252","authenticated-orcid":false,"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,21]]},"reference":[{"key":"2947_CR1","doi-asserted-by":"crossref","unstructured":"Bondy J.A. and Murty U.S.R., Graph Theory, Springer, 2008","DOI":"10.1007\/978-1-84628-970-5"},{"key":"2947_CR2","first-page":"233","volume":"58","author":"PA Catlin","year":"1987","unstructured":"Catlin, P.A.: Super-Eulerian graphs, collapsible graphs, and four-cycles. Congr. Numer. 58, 233\u2013246 (1987)","journal-title":"Congr. Numer."},{"key":"2947_CR3","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 subgraph. J. Graph Theory 12, 29\u201345 (1988)","journal-title":"J. Graph Theory"},{"key":"2947_CR4","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":"2947_CR5","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":"2947_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(92)90587-6","volume":"101","author":"H Fleischner","year":"1992","unstructured":"Fleischner, H.: Spanning eularian subgraphs, the splitting Lemma, and Petersen\u2019s theorem. Discrete Math. 101, 33\u201337 (1992)","journal-title":"Discrete Math."},{"key":"2947_CR7","unstructured":"Gould R.J., Traceability in Graphs (Doctoral thesis), Western Michigan University, 1979"},{"key":"2947_CR8","first-page":"46","volume":"26","author":"RJ Gould","year":"1999","unstructured":"Gould, R.J., Hynds, E.: A note on cycles in 2-factors of line graphs. Bull. Inst. Combin. Appl. 26, 46\u201348 (1999)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"2947_CR9","doi-asserted-by":"publisher","first-page":"2775","DOI":"10.1016\/j.disc.2006.11.023","volume":"307","author":"B Jackson","year":"2007","unstructured":"Jackson, B., Yoshimoto, K.: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Math. 307, 2775\u20132785 (2007)","journal-title":"Discrete Math."},{"key":"2947_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1002\/jgt.3190030110","volume":"3","author":"F Jaeger","year":"1979","unstructured":"Jaeger, F.: A note on subeulerian graphs. J. Graph Theory 3, 91\u201393 (1979)","journal-title":"J. Graph Theory"},{"key":"2947_CR11","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s003730200040","volume":"18","author":"M Kriesell","year":"2002","unstructured":"Kriesell, M.: A contribution to a conjecture of A. Saito, Graphs Combin. 18, 565\u2013571 (2002)","journal-title":"Saito, Graphs Combin."},{"key":"2947_CR12","doi-asserted-by":"crossref","unstructured":"Ryj\u00e1\u011bk Z., On a closure concept in claw-free graphs, J. Combin. Theory Ser.B 70 (1997) 217-224","DOI":"10.1006\/jctb.1996.1732"},{"key":"2947_CR13","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\u011bk","year":"1999","unstructured":"Ryj\u00e1\u011bk, 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":"2947_CR14","unstructured":"Shao Y., Claw-free graphs and line graphs (Doctoral thesis), West Virginia University, 1979"},{"key":"2947_CR15","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1016\/j.disc.2008.05.020","volume":"309","author":"L Xiong","year":"2009","unstructured":"Xiong, L., Lu, M., Han, L.: The structure of even factors in claw-free graphs. Discrete Math. 309, 2417\u20132423 (2009)","journal-title":"Discrete Math."},{"key":"2947_CR16","doi-asserted-by":"publisher","first-page":"2808","DOI":"10.1016\/j.disc.2006.11.022","volume":"307","author":"K Yoshimoto","year":"2007","unstructured":"Yoshimoto, K.: On the number of components in 2-factors of claw-free graphs. Discrete Math. 307, 2808\u20132819 (2007)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02947-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02947-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02947-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:20Z","timestamp":1760505080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02947-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,21]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2947"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02947-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,8,21]]},"assertion":[{"value":"27 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 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 authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"96"}}