Graph coloring (COL)
The decision problem of
coloring vertices of the given graph
such that
no adjacent vertices have the same color.
The decision problem of
coloring vertices of the given graph
such that
no adjacent vertices have the same color.