Chromatic polynomial
Summary
The chromatic polynomial of a finite graph counts its proper colourings as a function of the number of colours. It is a polynomial invariant of the graph that contains the chromatic number. The node chromatic polynomial gives the precise definition.
What this node 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 node is. They do not measure its truth.
Sources
What links here
Definitions
- Chromatic polynomial 038YGY0HSC