We prove that the edges of every even graph G=G1+G2 that is the join of two regular graphs Gi=(Vi,Ei) can be coloured with Δ(G) colours, whenever Δ(G)=Δ(G2)+|V1|. The proof of this result yields a combinatorial algorithm to optimally colour the edges of this type of graphs.