A note on stable sets and colorings of graphs

Svatopluk Poljak

Czech Digital Mathematics Library (Institute of Mathematics CAS) · 1974 · 154 citations · 0 references

Full text

Open access

Concepts

Abstract

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.