We could take a whole bunch of other problems such as vertex cover, clique, and independent set and of course many more and show these to be np-complete using a reduction because we were able to show that if you could solve vertex cover in polynomial time then you could also solve SAT in polynomial time and we'll now use a very similar technique. 