Let denote the graph obtained from by deleting one edge. We show that for every and every integer there exists an integer such that every graph whose order is divisible by and whose minimum degree is at least contains a -factor, i.e. a collection of disjoint copies of which covers all vertices of . This is best possible up to the error term and yields an approximate solution to a conjecture of Kawarabayashi.