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

Abstract

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 branchbonds 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.