A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs

Nathan Bowler, Joshua Erde, Florian Lehner +3

A \emph{dynamic colouring} of a graph is a proper colouring in which no neighbourhood of a non-leaf vertex is monochromatic. The \emph{dynamic colouring number} ${\chi }_2(G)$ of a graph…