Skip to main content
3 votes

Complexity of 2-coloring with extra constraints

The problem is NP-complete by a reduction from not-all-equal 3-satisfiability (NAE3SAT): Let $$\Phi = \bigwedge_{i=1}^n (l_{i,1} \lor l_{i,2} \lor l_{i,3})$$ be an instance of NAE3SAT. We construct a ...
badboul's user avatar
  • 107

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