1 paper
Ajit Diwan, Soumitra Pal, Abhiram Ranade
We introduce a generalization of the well known graph (vertex) coloring problem, which we call the problem of \emph{component coloring of graphs}. Given a graph, the problem is to…