Skip to main content
Share Your Experience: Take the 2024 Developer Survey
2 votes

Graph Coloring Decision Problem Reduction to Prove NP-Complete

SAT can be reduced to 3-SAT in a straightforward way (the Tseitin transform), and you seem to be aware that 3-SAT can be reduced to 3-coloring (e.g., https://www.cs.toronto.edu/~lalla/373s16/notes/...
D.W.'s user avatar
  • 161k

Only top scored, non community-wiki answers of a minimum length are eligible