Graph Coloring is a way of coloring the vertices of a undirected graph such that no two adjacent vertices share the same color.