The subchromatic number of a graph
The subchromatic number of a graph G is the least number of sets in a partition of V(G) such that each set induces a disjoint union of complete graphs. It follows that the subchromatic number of G is a lower bound for the chromatic number. In this paper various properties of subchromatic number are developed. The authors do a good job of relating their work with earlier investigations such as hereditary properties of graphs. The paper closes with a number of interesting open questions.
scientific article; zbMATH DE number 4114664
scientific article