Connected even factors in claw-free graphs

MingChu Li, Liming Xiong, Hajo Broersma

    Research output: Contribution to journalArticleAcademicpeer-review

    7 Citations (Scopus)
    72 Downloads (Pure)

    Abstract

    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
    Volume308
    Issue number11
    DOIs
    Publication statusPublished - 6 Jun 2008

    Keywords

    • Connected even factor
    • Cycle
    • Claw-free graphs
    • n/a OA procedure

    Fingerprint

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

    Cite this