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

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.