Definition:Chromatic Number

From ProofWiki
Jump to navigation Jump to search

Definition

The chromatic number $\map \chi G$ of a graph $G$ is the smallest positive integer $k$ such that there exists a proper vertex $k$-coloring of $G$.


Sources