Given a graph G , is there a 3-coloring with colors c1, c2 and c3 such that at most k nodes are given the color c1
and that no two adjacent nodes are given the same c
