Abstract

In this note, a direct proof is given of the NP-completeness of a
variant of GRAPH COLORING, i.e., a generic proof is given, similar to
the proof of Cook of the NP-completeness of SATISFIABILITY. Then,
transformations from this variant of GRAPH COLORING to INDEPENDENT
SET and to SATISFIABILITY are given.
These proofs could be useful
... read more