Vertex-disjoint copies of image in claw-free graphs Original Research Article

A graph G is said to be claw-free if G does not contain an induced subgraph isomorphic to image. Let k be an integer with image. We prove that if G is a claw-free graph of order at least image and with minimum degree at least 3, then G contains k vertex-disjoint copies of image.