Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
Broersma, H.J. and Paulusma, D.
(2008)
Computing sharp 2-factors in claw-free graphs.
In: 33rd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland.
pp. 193-204.
Lecture Notes in Computer Science 5162.
Springer Verlag.
ISSN 0302-9743
ISBN 978-3-540-85237-7
There is a more recent version of this eprint available. Click here to view it. Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-540-85238-4_15  AbstractIn 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.
Available Versions of this Item
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||
