3-CNF-Sat <P 3-Color

• Given a 3-CNF formula F we have to show how to construct in polynomial time a graph G such that:

  • F is satisfiable implies G is 3-colorable
  • G is 3-colorable implies F is satisfiable

Previous slide

Next slide

Back to first slide

View graphic version