Chromatic number
Summary
The chromatic number of a graph is the least number of colours in a proper colouring. It is a central invariant of graph theory, and the four colour theorem bounds it for planar graphs. The node chromatic number gives the precise definition.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Graph_coloring, Vertex coloring
What links here
Definitions
- Chromatic number 0C5M7AM6FH