Pancyclicity modk of claw-free graphs and K1,4-free graphs

AbstractFor any natural number k, a graph G is said to be pancyclic modk if it contains a cycle of every length modulo k. In this paper, we show that every K1,4-free graph G with minimum degree δ(G)⩾k+3 is pancyclic modk and every claw-free graph G with δ(G)⩾k+1 is pancyclic modk, which confirms Thomassen's conjecture (J. Graph Theory 7 (1983) 261–271) for claw-free graphs