Hardness of finding a graph coloring given the optimal number of colors
Posted by Arman, at cstheory.stackexchange.com,
We know that graph coloring is NP-complete even in some special graph classes. On the other hand if someone tells you the exact…