Reduce satisfiability to not-all-equal clauses, then to Max Cut. Complementary literals are joined by an edge, and each clause contributes a triangle. Replacing each edge occurrence by a three-edge path yields a simple unweighted graph.