1. Reduction of 3-SAT to Clique
The following slideshow shows that an instance of 3-CNF Satisfiability
problem can be reduced to an instance of Clique problem in
polynomial time.
This reduction can help in providing an NP Completeness proof for
the Clique problem.