Computing sharp 2-factors in claw-free graphs

Haitze J. Broersma, Daniël Paulusma

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

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.
Original languageUndefined
Title of host publication33rd International Symposium on Mathematical Foundations of Computer Science
Place of PublicationBerlin
PublisherSpringer
Pages193-204
Number of pages12
ISBN (Print)978-3-540-85237-7
DOIs
Publication statusPublished - Aug 2008
Event33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008: Mathematical Foundations of Computer Science - Torun, Poland, Torun, Poland
Duration: 25 Aug 200829 Aug 2008
Conference number: 33

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
NumberWoTUG-31
Volume5162
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008
Abbreviated titleMFCS 2008
CountryPoland
CityTorun
Period25/08/0829/08/08
OtherAugust 27-31, 2008

Keywords

  • EWI-14142
  • IR-62551
  • METIS-254914

Cite this