{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T06:47:33Z","timestamp":1765176453848},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"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":[[2009,11]]},"DOI":"10.1007\/s00373-009-0855-7","type":"journal-article","created":{"date-parts":[[2009,12,11]],"date-time":"2009-12-11T09:35:40Z","timestamp":1260524140000},"page":"427-460","source":"Crossref","is-referenced-by-count":7,"title":["Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs"],"prefix":"10.1007","volume":"25","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Kiyoshi","family":"Yoshimoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,12]]},"reference":[{"key":"855_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-7643-7400-6"},{"key":"855_CR2","doi-asserted-by":"crossref","unstructured":"Choudum, S.A., Paulraj, M.S.: Regular factors in K 1,3-free graphs. J. Graph Theory 15, 259\u2013265 (1991)","DOI":"10.1002\/jgt.3190150304"},{"key":"855_CR3","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 2nd ed., Graduate Texts in Mathematics, Vol. 173. Springer, Heidelberg (2000)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"855_CR4","doi-asserted-by":"crossref","unstructured":"Egawa, Y., Ota, K.: Regular factors in K 1,n -free graphs. J. Graph Theory 15, 337\u2013344 (1991)","DOI":"10.1002\/jgt.3190150310"},{"key":"855_CR5","unstructured":"Egawa, Y., Saito, A.: Private communications"},{"key":"855_CR6","doi-asserted-by":"crossref","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)","DOI":"10.1016\/S0012-365X(98)00398-7"},{"key":"855_CR7","doi-asserted-by":"crossref","unstructured":"Faudree, R., Flandrin, R., Ryj\u00e1\u010dek, Z.: Claw-free graphs\u2014a survey. Discrete Math. 164, 87\u2013147 (1997)","DOI":"10.1016\/S0012-365X(96)00045-3"},{"key":"855_CR8","doi-asserted-by":"crossref","unstructured":"Fleischner, H.: Spanning Eulerian subgraphs, the splitting lemma, and Petersen\u2019s theorem. Discrete Math. 101, 33\u201337 (1992)","DOI":"10.1016\/0012-365X(92)90587-6"},{"key":"855_CR9","doi-asserted-by":"crossref","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)","DOI":"10.7151\/dmgt.1213"},{"key":"855_CR10","doi-asserted-by":"crossref","unstructured":"Jackson, B., Yoshimoto, K.: Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discrete Math. 307, 2775\u20132785 (2007)","DOI":"10.1016\/j.disc.2006.11.023"},{"key":"855_CR11","unstructured":"Jackson, B., Yoshimoto, K.: Spanning even subgraphs of 3-edge-connected graphs. J. Graph Theory, (to appear)"},{"key":"855_CR12","unstructured":"Gould, R.J., Hynds, E.: A note on cycles in 2-factors of line graphs. Bull. ICA 26, 46\u201348 (1999)"},{"key":"855_CR13","doi-asserted-by":"crossref","unstructured":"Gould, R.J., Jacobson, M.S.: Two-factors with few cycles in claw-free graphs. Discrete Math. 231, 191\u2013197 (2001)","DOI":"10.1016\/S0012-365X(00)00317-4"},{"key":"855_CR14","unstructured":"Harary, F., Nash-Williams, C.St.J.A.: On eulerian and hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701\u2013710 (1965)"},{"key":"855_CR15","doi-asserted-by":"crossref","unstructured":"Matthews, M.M., Sumner, D.P.: Hamiltonian results in K 1, 3-free graphs. J. Graph Theory 8, 139\u2013146 (1984)","DOI":"10.1002\/jgt.3190080116"},{"key":"855_CR16","doi-asserted-by":"crossref","unstructured":"Plummer, M.D.: Graph factors and factorization: 1985\u20132003: A survey. Discrete Math. 307, 791\u2013821 (2007)","DOI":"10.1016\/j.disc.2005.11.059"},{"key":"855_CR17","unstructured":"Ryj\u00e1\u010dek, Z.: On a closure concept in claw-free graphs. J. Comb. Theory Ser. B 70, 217\u2013224 (1997)"},{"key":"855_CR18","doi-asserted-by":"crossref","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)","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<109::AID-JGT1>3.0.CO;2-O"},{"key":"855_CR19","doi-asserted-by":"crossref","unstructured":"Yoshimoto, K.: On the number of components in 2-factors of claw-free graphs. Discrete Math. 307, 2808\u20132819 (2007)","DOI":"10.1016\/j.disc.2006.11.022"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0855-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-009-0855-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-009-0855-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:29Z","timestamp":1559055509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-009-0855-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["855"],"URL":"https:\/\/doi.org\/10.1007\/s00373-009-0855-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}