Home▸Combinatorics & Graph Theory▸Graph Coloring — Vertex Coloring Algorithms (2D)

🎨 Graph Coloring — Vertex Coloring Algorithms (2D)

2D graph-coloring visualizer: watch greedy, Welsh-Powell, DSatur and real backtracking search colour a graph's vertices so no two neighbours share a colour, step by step or in manual mode.

Combinatorics & Graph Theory2DModerate60 FPS📱 Mobile-adapted⇄ 3D version

⚙ Under the hood

This 2D simulation colours the vertices of a graph so that no two connected vertices share a colour. Choose the greedy, Welsh-Powell, DSatur or exact backtracking algorithm, run it instantly or step through it one move at a time. You can also switch to manual mode and colour vertices yourself while the panel shows the number of colours used and any conflicts.

graph theorycombinatoricsalgorithmsbacktrackingchromatic number

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install