"The assignment of colours to the edges of graph G such that no two adjacent edges get the same colour and there is no 2-coloured cycle in G is known as Acyclic Edge Colouring. The minimum number of colours needed to ...