Lecture 37: Graph coloring

Graph coloring

An \(X\)-coloring of a graph \(G = (V,E)\) is a function \(c : V → X\) satisfying \(c(u) \neq c(v)\) whenever \((u,v) \in E\).

A \(k\)-coloring is a \(\{1,2,\dots,k\}\)-coloring.

Examples:

Facts: