Chromatic polynomial

Layer 0 — Mathematicsin the graph-theory subtree

P(G, k) counts proper k-colourings of G; a polynomial of degree |V| with integer coefficients. Recurrence P(G,k) = P(G−e, k) − P(G/e, k) enables computation.

Related concepts

Explore Chromatic polynomial on the interactive knowledge graph →