Four Color Theorem
Every planar graph can be colored with at most 4 colors such that no adjacent vertices share a color. Watch greedy backtracking coloring in action.
Press "Color Graph" to begin
Color 1
Color 2
Color 3
Color 4
Nodes: 0 | Edges: 0 | Colors used: 0