We know that the chromatic number of a graph $G$ is the smallest number of colors needed to color the vertices of $G$ so that no two adjacent vertices share the same color .
But why the coloring is NP-HARD ? and what is the difference between it and vertex coloring ?
