Connected even factors in claw-free graphs

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