{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:48Z","timestamp":1725517188366},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_15","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T11:34:36Z","timestamp":1219059276000},"page":"193-204","source":"Crossref","is-referenced-by-count":2,"title":["Computing Sharp 2-Factors in Claw-Free Graphs"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Broersma, H.J., Paulusma, D., Yoshimoto, K.: Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs (submitted), \n                    \n                      http:\/\/www.dur.ac.uk\/daniel.paulusma\/Papers\/Submitted\/claw.pdf"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0012-365X(97)00210-0","volume":"185","author":"H.J. Broersma","year":"1998","unstructured":"Broersma, H.J., Trommel, H.: Closure concepts for claw-free graphs. Discrete Math.\u00a0185, 231\u2013238 (1998)","journal-title":"Discrete Math."},{"key":"15_CR3","doi-asserted-by":"publisher","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\n                  1,3-free graphs. J. Graph Theory\u00a015, 259\u2013265 (1991)","journal-title":"J. Graph Theory"},{"key":"15_CR4","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2000)","edition":"2"},{"key":"15_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\n                  1,n\n                  -free graphs. J. Graph Theory\u00a015, 337\u2013344 (1991)","journal-title":"J. Graph Theory"},{"key":"15_CR6","doi-asserted-by":"publisher","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.\u00a0206, 131\u2013137 (1999)","journal-title":"Discrete Math."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R. Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs\u2014a survey. Disc. Math.\u00a0164, 87\u2013147 (1997)","journal-title":"Disc. Math."},{"key":"15_CR8","doi-asserted-by":"crossref","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. Discussiones Mathematicae Graph Theory\u00a024, 55\u201371 (2004)","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"15_CR9","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co, New York (1979)"},{"key":"15_CR10","first-page":"46","volume":"26","author":"R. Gould","year":"1999","unstructured":"Gould, R., Hynds, E.: A note on cycles in 2-factors of line graphs. Bull. of ICA.\u00a026, 46\u201348 (1999)","journal-title":"Bull. of ICA."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0012-365X(00)00317-4","volume":"231","author":"R.J. Gould","year":"2001","unstructured":"Gould, R.J., Jacobson, M.S.: Two-factors with few cycles in claw-free graphs. Discrete Math.\u00a0231, 191\u2013197 (2001)","journal-title":"Discrete Math."},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading MA (1969)"},{"key":"15_CR13","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.\u00a0307, 2775\u20132785 (2007)","journal-title":"Discrete Math."},{"key":"15_CR14","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory, North-Holland Mathematics Studies 121. North-Holland, Amsterdam"},{"key":"15_CR15","doi-asserted-by":"publisher","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\n                  1, 3-free graphs. J. Graph Theory\u00a08, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"M.D. Plummer","year":"2007","unstructured":"Plummer, M.D.: Graph factors and factorization: 1985-2003: A survey. Discrete Math.\u00a0307, 791\u2013821 (2007)","journal-title":"Discrete Math."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max{m,n} algorithm for determining the graph H from its line graph G. Information Processing Letters\u00a02, 108\u2013112 (1973)","journal-title":"Information Processing Letters"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z. Ryjacek","year":"1997","unstructured":"Ryjacek, Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B\u00a070, 217\u2013224 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"15_CR19","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. Ryjacek","year":"1999","unstructured":"Ryjacek, Z., Saito, A., Schelp, R.H.: Closure, 2-factor, and cycle coverings in claw-free graphs. J. Graph Theory\u00a032, 109\u2013117 (1999)","journal-title":"J. Graph Theory"},{"key":"15_CR20","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 a 2-factor of a claw-free graph. Discrete Math.\u00a0307, 2808\u20132819 (2007)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:09Z","timestamp":1619508669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}