Minimum degree conditions for the existence of cycles of all lengths modulo $k$ in graphs

Abstract

Thomassen, in 1983, conjectured that for a positive integer $k$, every $2$-connected non-bipartite graph of minimum degree at least $k+1$ contains cycles of all lengths modulo $k$. In this paper, we settle this conjecture affirmatively.

29 pages, 4 figures

Cited by in corpus (1)

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