factors with bounded number of components in claw-free graphs

factors with bounded number of components in claw-free graphs

In this paper, we show that every -connected claw-free graph has a -factor having at most cycles, where is the independence number of . As a corollary of this result, we also prove that every -connected claw-free graph has a -factor with at most cycles, where is the minimum degree of . This is an ex...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2015-05, Vol.338 (5), p.793-808
Hauptverfasser: Ozeki, Kenta, Ryjacek, Zdenek, Yoshimoto, Kiyoshi
Format: Artikel
Sprache:eng
Schlagworte:
Graphs
Mathematical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we show that every -connected claw-free graph has a -factor having at most cycles, where is the independence number of . As a corollary of this result, we also prove that every -connected claw-free graph has a -factor with at most cycles, where is the minimum degree of . This is an extension of a known result on the number of cycles of a -factor in -connected claw-free graphs.
ISSN:0012-365X
DOI:10.1016/j.disc.2014.12.017