Regular factors in K1,3-free graphs

We show that every connected K_1,3-free graph with minimum degree at least 2k contains a k-factor and construct connected K_1,3-free graphs with minimum degree k + 0(√k) that have no k-factor.