{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:48:13Z","timestamp":1765176493100},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,11,9]],"date-time":"2013-11-09T00:00:00Z","timestamp":1383955200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1375-z","type":"journal-article","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T04:55:25Z","timestamp":1383886525000},"page":"99-113","source":"Crossref","is-referenced-by-count":2,"title":["2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths"],"prefix":"10.1007","volume":"31","author":[{"given":"Roman","family":"\u010cada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuya","family":"Chiba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoshi","family":"Yoshimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,9]]},"reference":[{"key":"1375_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0012-365X(01)00214-X","volume":"243","author":"K. Ando","year":"2002","unstructured":"Ando K., Egawa Y., Kaneko A., Kawarabayashi K., Matsuda H.: Path factors in claw-free graphs. Discrete Math. 243, 195\u2013200 (2002)","journal-title":"Discrete Math."},{"key":"1375_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/jgt.1008","volume":"37","author":"H.J. Broersma","year":"2001","unstructured":"Broersma H.J., Kriesell M., Ryj\u00e1\u010dek Z.: On factors of 4-connected claw-free graphs. J. Graph Theory 37, 125\u2013136 (2001)","journal-title":"J. Graph Theory"},{"key":"1375_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s00373-009-0855-7","volume":"25","author":"H.J. Broersma","year":"2009","unstructured":"Broersma H.J., Paulusma D., Yoshimoto K.: Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs. Graphs Combin. 25, 427\u2013460 (2009)","journal-title":"Graphs Combin."},{"key":"1375_CR4","unstructured":"\u010cada, R., Chiba, S., Yoshimoto, K.: private communications."},{"key":"1375_CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/jgt.3190150304","volume":"15","author":"S.A. 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":"1375_CR6","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1375_CR7","doi-asserted-by":"crossref","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":"1375_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0012-365X(98)00398-7","volume":"206","author":"R.J. 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":"1375_CR9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/jgt.20579","volume":"69","author":"R.J. 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":"1375_CR10","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"Harary F., Nash-Williams C.St.J.A.: On Eulerian and Hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701\u2013710 (1965)","journal-title":"Can. Math. Bull."},{"key":"1375_CR11","doi-asserted-by":"crossref","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":"1375_CR12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.20386","volume":"62","author":"B. Jackson","year":"2009","unstructured":"Jackson B., Yoshimoto K.: Spanning even subgraphs of 3-edge-connected graphs. J. Graph Theory 62, 37\u201347 (2009)","journal-title":"J. Graph Theory"},{"key":"1375_CR13","doi-asserted-by":"crossref","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":"1375_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"M.M. 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":"1375_CR15","unstructured":"Ozeki, K., Ryj\u00e1\u010dek, Z., Yoshimoto, K.: 2-factors with bounded number of components in claw-free graphs (submitted)"},{"key":"1375_CR16","doi-asserted-by":"crossref","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":"1375_CR17","doi-asserted-by":"crossref","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":"1375_CR18","doi-asserted-by":"crossref","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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1375-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1375-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1375-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T01:49:28Z","timestamp":1564624168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1375-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1375"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1375-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,9]]}}}