A note on cycle lengths in graphs of chromatic number five and six

Qingyi Huo

In this note, we prove that every non-complete $(k+1)$-critical graph contains cycles of all lengths modulo $k$, where $k=4,5$.