Equitably colourable cycle decompositions A $c$-colouring of a decomposition of a graph $G$ is an assignment of $c$ colours to the vertices of $G$. A colouring is equitable if each colour is represented (as closely as possible) an equal number