Connected even factors in claw-free graphs

Ming Chu Li; Liming Xiong; H. J. Broersma

doi:10.1016/j.disc.2007.04.058

Connected even factors in claw-free graphs

Ming Chu Li^*, Liming Xiong, H. J. Broersma

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K_{1, s}-free graph (s ≥ 2) contains a connected even [2, 2 s - 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 language	English
Pages (from-to)	2282-2284
Number of pages	3
Journal	Discrete Mathematics
Volume	308
Issue number	11
DOIs	https://doi.org/10.1016/j.disc.2007.04.058
Publication status	Published - 6 Jun 2008

Keywords

Claw-free graph
Connected even factor
Cycle

Access to Document

10.1016/j.disc.2007.04.058

Cite this

Li, M. C., Xiong, L., & Broersma, H. J. (2008). Connected even factors in claw-free graphs. Discrete Mathematics, 308(11), 2282-2284. https://doi.org/10.1016/j.disc.2007.04.058

@article{9dd1cac7099c4ba6851f8ac4bc851541,

title = "Connected even factors in claw-free graphs",

abstract = "A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K1, s-free graph (s ≥ 2) contains a connected even [2, 2 s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek.",

keywords = "Claw-free graph, Connected even factor, Cycle",

author = "Li, {Ming Chu} and Liming Xiong and Broersma, {H. J.}",

year = "2008",

month = jun,

day = "6",

doi = "10.1016/j.disc.2007.04.058",

language = "English",

volume = "308",

pages = "2282--2284",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - Connected even factors in claw-free graphs

AU - Li, Ming Chu

AU - Xiong, Liming

AU - Broersma, H. J.

PY - 2008/6/6

Y1 - 2008/6/6

N2 - A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K1, s-free graph (s ≥ 2) contains a connected even [2, 2 s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek.

AB - A connected even [2, 2 s]-factor of a graph G is a connected factor with all vertices of degree i (i = 2, 4, ..., 2 s), where s ≥ 1 is an integer. In this paper, we show that every supereulerian K1, s-free graph (s ≥ 2) contains a connected even [2, 2 s - 2]-factor, hereby generalizing the result that every 4-connected claw-free graph has a connected [2, 4]-factor by Broersma, Kriesell and Ryjacek.

KW - Claw-free graph

KW - Connected even factor

KW - Cycle

UR - http://www.scopus.com/inward/record.url?scp=40649091123&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2007.04.058

DO - 10.1016/j.disc.2007.04.058

M3 - Article

AN - SCOPUS:40649091123

SN - 0012-365X

VL - 308

SP - 2282

EP - 2284

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 11

ER -

Connected even factors in claw-free graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this