Module 1

Visual Sandbox

Pick a graph. Watch DSATUR color it greedily, step by step. Invert a Kempe chain to see the trick that proves the (much easier) 5-color theorem.

n=6 · used 4 of 4
edge 0–1edge 0–2edge 0–3edge 0–4edge 0–5edge 1–2edge 1–5edge 2–3edge 3–4edge 4–5vertex 0 · deg 5 · A·vermilionvertex 1 · deg 3 · B·ochrevertex 2 · deg 3 · C·viridianvertex 3 · deg 3 · B·ochrevertex 4 · deg 3 · C·viridianvertex 5 · deg 3 · D·indigo
100%