4-factors in 2-connected star-free graphs

Let t ≥ 3 be an integer. We show that if G is a 2-connected K 1 , t -free graph with minimum degree at least ( 3 t + 1 ) / 2 , then G has a 4-factor.