A note on stable sets and colorings of graphs
Svatopluk Poljak · Czech digital mathematics library · 1974
It is given here an explicit reduction of the problem of determining the stability number ec(<*) of a graph G into the problem of determining the chromatic number *CH) of a graph.H .This is related to the Karp-Cook complexity theory.