Color graph vertices so no two adjacent vertices share the same color. The minimum number of colors needed is the chromatic number. Click to add nodes, connect them with edges, and explore classic graph theory.
The greedy algorithm assigns each vertex the smallest available color not used by its neighbors. While not always optimal, it provides an upper bound on the chromatic number. For perfect graphs (bipartite, interval), greedy with optimal ordering achieves the chromatic number.