Title of article
Path factors in claw-free graphs
Author/Authors
Kiyoshi Ando، نويسنده , , Yoshimi Egawa، نويسنده , , Atsushi Kaneko، نويسنده , , Ken-ichi Kawarabayashi، نويسنده , , Haruhide Matsuda، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
6
From page
195
To page
200
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.
Keywords
Path factor , Claw-free
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
949892
Link To Document