Acyclic colourings of graphs with bounded degree

Anna Fiedorowicz, Elżbieta Sidorowicz

A $k$-colouring (not necessarily proper) of vertices of a graph is called {\it acyclic}, if for every pair of distinct colours $i$ and $j$ the subgraph induced by the edges whose e…