Greedy & Backtracking Algorithms
Greedy: assign the smallest valid color to each vertex in order — fast but may use extra colors. Backtracking: exhaustive search for minimum chromatic number — optimal but exponential worst case. Drag nodes to rearrange.