On 2-factors in claw-free graphs whose edges are in small cycles

Runli Tian; Liming Xiong; Zhaohong Niu

doi:10.1016/j.disc.2012.07.005

On 2-factors in claw-free graphs whose edges are in small cycles

Runli Tian, Liming Xiong^*, Zhaohong Niu

^*Corresponding author for this work

School of Mathematics and Statistics

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

2 Citations (Scopus)

Abstract

It is showed that every simple claw-free graph of minimum degree at least 3 in which every edge lies in a cycle of length at most 5 has a 2-factor.

Original language	English
Pages (from-to)	3140-3145
Number of pages	6
Journal	Discrete Mathematics
Volume	312
Issue number	21
DOIs	https://doi.org/10.1016/j.disc.2012.07.005
Publication status	Published - 6 Nov 2012

Keywords

2-factor
Claw-free graph
Line graph

Access to Document

10.1016/j.disc.2012.07.005

Cite this

Tian, R., Xiong, L., & Niu, Z. (2012). On 2-factors in claw-free graphs whose edges are in small cycles. Discrete Mathematics, 312(21), 3140-3145. https://doi.org/10.1016/j.disc.2012.07.005

@article{b826713f7a8a45d591f8487d4a48acae,

title = "On 2-factors in claw-free graphs whose edges are in small cycles",

abstract = "It is showed that every simple claw-free graph of minimum degree at least 3 in which every edge lies in a cycle of length at most 5 has a 2-factor.",

keywords = "2-factor, Claw-free graph, Line graph",

author = "Runli Tian and Liming Xiong and Zhaohong Niu",

year = "2012",

month = nov,

day = "6",

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

language = "English",

volume = "312",

pages = "3140--3145",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "21",

}

TY - JOUR

T1 - On 2-factors in claw-free graphs whose edges are in small cycles

AU - Tian, Runli

AU - Xiong, Liming

AU - Niu, Zhaohong

PY - 2012/11/6

Y1 - 2012/11/6

N2 - It is showed that every simple claw-free graph of minimum degree at least 3 in which every edge lies in a cycle of length at most 5 has a 2-factor.

AB - It is showed that every simple claw-free graph of minimum degree at least 3 in which every edge lies in a cycle of length at most 5 has a 2-factor.

KW - 2-factor

KW - Claw-free graph

KW - Line graph

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

U2 - 10.1016/j.disc.2012.07.005

DO - 10.1016/j.disc.2012.07.005

M3 - Article

AN - SCOPUS:84865103621

SN - 0012-365X

VL - 312

SP - 3140

EP - 3145

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 21

ER -

On 2-factors in claw-free graphs whose edges are in small cycles

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this