Edge Coloring of a Graph In graph idea, edge coloring of the graph is undoubtedly an assignment of "colours" to the edges from the graph so that no two adjacent edges contain the exact color having an optimal quantity of colors.Sequence no 6 is a Route since the sequence FDECB will not include any repeated edges and vertices.Mathematics Previously