Cycle chromatic polynomial: P(C_N, k) = (k-1)^N + (-1)^N (k-1) (deletion-contraction / Polya enumeration)

Layer 1 — Physicsin the network-physics subtree

Cycle chromatic-polynomial framework via Polya enumeration / deletion-contraction. Setup: for a graph G, the chromatic polynomial P(G, k) counts the number of proper vertex colourings with at most k colours. By the Whitney…

Related concepts

Pólya enumeration theorem
Theorem: P(C_4, k) expanded = k^4 - 4 k^3 + 6 k^2 - 3 k (explicit polynomial identity)

Explore Cycle chromatic polynomial: P(C_N, k) = (k-1)^N + (-1)^N (k-1) (deletion-contraction / Polya enumeration) on the interactive knowledge graph →