Author/Authors :
Kiyoshi Ando، نويسنده , , Yoshimi Egawa، نويسنده , , Atsushi Kaneko، نويسنده , , Ken-ichi Kawarabayashi، نويسنده , , Haruhide Matsuda، نويسنده ,
Abstract :
A graph G is called claw-free if G has no induced subgraph isomorphic to K1,3. We prove that if G is a claw-free graph with minimum degree at least d, then G has a path factor such that the order of each path is at least d+1.
