Edge Coloring of the Graph In graph concept, edge coloring of a graph is really an assignment of "colours" to the edges of your graph so that no two adjacent edges possess the same coloration having an best variety of colors.A bipartite graph is alleged to get complete if there exist an edge amongst each set of vertices from V1 and V2.Little ones u