- given a graph $G$, how many colors does it take so that when coloring each vertex, no two adjacent vertices share the same color - 3 coloring & above is [[NP Hard Problems|NP Hard]]