Combinatorics Coloring Concept
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.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 0B621RBVS9 |
|---|---|
| URI | m2://0B621RBVS9 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C31, 05C15 |
| Same as |
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.