Even Factors with Degree at Most Four in Claw-Free Graphs

Authors:
Qiuxin Wu;Liming Xiong;Tingzeng Wu
Affiliations:
College of Science Beijing Institute of Machinery, Beijing 100085, P.R. China;Department of Mathematics, Beijing Institute of Technology, Beijing 100081, P.R. of China;Department of Mathematics, Qinghai Nationalities College, Qinghai, 810007, P.R. China
Venue:
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Year:
2007

Citing 4
Cited 0

Regular factors in K1,3-free graphs

Journal of Graph Theory
Regular factors in K1,n-free graphs

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications
The upper bound of the number of cycles in a 2-factor of a line graph

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we will prove that every simple claw-free graph G with the minimum degree at least two such that each of its odd branch-bonds contains a branch of length one has an even factor of degree 2 or 4. Some examples showed the conclusion can not be replaced by "2-factor" even for 2-connected graphs.