Edge Coloring of a Graph In graph idea, edge coloring of the graph is undoubtedly an assignment of "shades" to the perimeters in the graph to ensure that no two adjacent edges have the exact shade using an optimum range of shades.A bipartite graph is claimed to be full if there exist an edge concerning each and every set of vertices from V1 and V2.