Distance colouring without one cycle length

Ross J. Kang, François Pirot

We consider distance colourings in graphs of maximum degree at most $d$ and how excluding one fixed cycle length $\ell$ affects the number of colours required as $d\to \infty$. For…