Acyclic colourings of graphs with obstructions

Quentin Chuet, Johanne Cohen, François Pirot

Given a graph $G$, a colouring of $G$ is \emph{acyclic} if it is a proper colouring of $G$ and every cycle contains at least three colours. Its acyclic chromatic number ${\chi }_a(G)$ is…