Edge Coloring of a Graph In graph concept, edge coloring of a graph is an assignment of "hues" to the sides on the graph making sure that no two adjacent edges contain the similar shade with the optimum number of hues. This process utilizes very simple assumptions for optimizing the sup