Graph colouring

Layer 0 — Mathematicsin the graph-theory subtree

An assignment of colours to vertices so that adjacent vertices differ. Chromatic number χ(G) is NP-hard to compute. Related to scheduling, register allocation, map colouring.

Related concepts

Explore Graph colouring on the interactive knowledge graph →