An acyclic edge colouring of a graph is an assignment of colours to its edges in such a way that incident edges get distinct colours, and the edges of any cycle use atleast three distinct colours. The latter condition is ...