Vertex Coloring
Input description: A graph G=(V,E), k
Problem description: Is it possible to color the vertices of the graph using at most k colors such that for each edge (i,j) in E, vertices i and j have different colors
Optimization version: minimize the number of colors used.
Example: Register allocation for compilers.