Pancyclicity mod \(k\) of claw-free graphs and \(K_{1,4}\)-free graphs (Q5931413)

For any natural number \(k\), a graph \(G\) is called pancyclic \(\text{mod }k\) if it has a cycle of every length modulo \(k\). It is shown that every \(K_{1,4}\)-free graph \(G\) with minimum degree \(\delta(G)\geq k+3\) is pancyclic \(\text{mod }k\) and that every claw-free graph \(G\) with \(\delta(G)\geq k+1\) is pancycic \(\text{mod }k\). The later confirms a conjecture by \textit{C. Thomassen} [J. Graph Theory 7, 261-271 (1983; Zbl 0515.05052)] in the case of claw-free graphs.