I am given with a graph G(V,E) and k number of colors. To maximize the use of the colors, a node can possess more than one color subject to adjacency constraint. In this multi-coloring scenario, how can I balance the allocation of colors to the nodes?

Similar questions and discussions