математика хроматическое число
The smallest number of colours necessary to colour the nodes of a graph so that no two adjacent nodes have the same colour. See also: four colour map theorem.