The NP-hardnes of the subchromatic number problem is proved and algorithms are determined for varous classes of graphs.
