Reduction

Not too bad.

Graph has a 3 coloring if and only if formula has a satisfying assignment.


next up previous
Next: Colorability Complexity for Planar Up: NP-COMPLETE PROBLEMS Previous: Solving 3-colorability