3-Colorability

• Input: Graph G = (V,E) and a number k.

• Output: Determine if all vertices can be colored with 3 colors such that no two adjacent vertices have the same color.

3-colorable

Not 3-colorable

Previous slide

Next slide

Back to first slide

View graphic version