Computing Sharp 2-Factors in Claw-Free Graphs
In a recently submitted paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we extend these results by presenting a polynomial algorithm that constructs a 2-factor of a claw-free graph with minimum degree at least four whose number of components meets this bound. As a byproduct we show that the problem of obtaining a minimum 2-factor (if it exists) is polynomially solvable for a subclass of claw-free graphs. As another byproduct we give a short constructive proof for a result of Ryjáček, Saito & Schelp.
Unable to display preview. Download preview PDF.
- 1.Broersma, H.J., Paulusma, D., Yoshimoto, K.: Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs (submitted), http://www.dur.ac.uk/daniel.paulusma/Papers/Submitted/claw.pdf
- 4.Diestel, R.: Graph Theory, 2nd edn. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2000)Google Scholar
- 12.Harary, F.: Graph Theory. Addison-Wesley, Reading MA (1969)Google Scholar
- 14.Lovasz, L., Plummer, M.D.: Matching Theory, North-Holland Mathematics Studies 121. North-Holland, AmsterdamGoogle Scholar