1 paper
Robiul Islam, Arup Kumar Pramanik
The graph coloring problem (GCP) is one of the most studied NP-HARD problems in computer science. Given a graph , the task is to assign a color to all vertices such that no vertice…