Portal de Periódicos da CAPES

Path factors in claw-free graphs

2002; Elsevier BV; Volume: 243; Issue: 1-3 Linguagem: Inglês

10.1016/s0012-365x(01)00214-x

1872-681X

Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken‐ichi Kawarabayashi, Haruhide Matsuda,

Graph theory and applications

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.