Component factors with large components in graphs

In this paper we obtain sufficient conditions using isolated vertices for component factors with each component of order at least three. In particular, we show that if a graph G satisfies iso ( G − S ) ≤ | S | / 2 for all S ⊂ V ( G ) , then G has a { K 1 , 2 , K 1 , 3 , K 5 } -factor, where iso ( G − S ) denotes the number of isolated vertices in G − S .