The $3-$color problem asks given a undirected graph $$

whether it can be colored with $3$

or fewer colors. I.e$,$ assign each vertex of the graph one of three colors say Red, Blue, Green such that vertices connected by an edge should not have the same color.