Let [p] = {1, 2, 3, . . . , p} and G be an undirected simple graph. Graph coloring is a special case of labeling, and G is said to admit a proper coloring if no two neighbouring vertices of it are given an identical color. ...