Combinatorics Coloring Concept
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.
Where this leads
6 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Graph_coloring, Vertex coloring
About this page
| Tag | 0VHJRXNAAS |
|---|---|
| URI | m2://0VHJRXNAAS |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C15 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.