The subchromatic number of a graph (Q1823255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4114664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The subchromatic number of a graph |
scientific article; zbMATH DE number 4114664 |
Statements
The subchromatic number of a graph (English)
0 references
1989
0 references
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.
0 references
complete graph
0 references
subchromatic number
0 references
chromatic number
0 references
0 references
0.808623194694519
0 references
0.7908987402915955
0 references
