Not too bad.
- Triangle: true, false, red.
- Each literal becomes a node with an edge to ``red.'' Its color
(which can only be ``true'' or ``false'') represents its assignment.
A literal and its complement are connected by an edge to assure that
they don't get the same color.
- Each clause becomes a set of 5 nodes (widget): insures that all 3
literals are not ``false.'' (Proof by exhaustion.)
x-o
|\
y-o-o-o
|\
z-----o-true
x
|\
~x-red
Graph has a 3 coloring if and only if formula has a satisfying
assignment.
Next: Colorability Complexity for Planar
Up: NP-COMPLETE PROBLEMS
Previous: Solving 3-colorability