On Connected $[k,k+1]$-Factors in Claw-Free Graphs

Abstract

It is shown in this paper that every $2$-connected claw-free graph containing a $k$-factor has a connected $[k,k+1]$-factor, where $k\ge 2$.