Connected even factors in claw-free graphs

M.C. Li, L. Xiong, Haitze J. Broersma

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)
47 Downloads (Pure)


A connected even $[2,2s]$-factor of a graph $G$ is a connected factor with all vertices of degree $i(i=2,4,\ldots,2s)$, where $s\ge 1$ is an integer. In this paper, we show that every supereulerian $K_{1,s}$-free graph $(s\ge 2)$ contains a connected even $[2,2s-2]$-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected $[2,4]$-factor by Broersma, Kriesell and Ryjacek.
Original languageEnglish
Pages (from-to)2282-2284
Number of pages3
JournalDiscrete mathematics
Issue number11
Publication statusPublished - 6 Jun 2008


  • connected even factor
  • cycle
  • claw-free graph


Dive into the research topics of 'Connected even factors in claw-free graphs'. Together they form a unique fingerprint.

Cite this