Graph Coloring
Greedy coloring — minimum colors so no adjacent nodes share colors
Greedy Color
Optimal Color
Petersen
Planar
Bipartite
Random
Clear
Choose a preset graph, then color it. Greedy is fast. Optimal finds minimum colors (slow for large graphs).