1 paper
Maurice Almeida, Ravindra Pawar, Siddharth Gupta +1
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that every vertex has an equal number of…