Greedy Graph Coloring
On a Crown Graph — bipartite, so
2 colors are enough
. Can greedy find that?
partition 1
partition 2
A
C
E
B
D
F
1st
2nd
3rd
4th
5th
6th
← Back
▶ Play
Next →
↺
Press
Play
or
Next →
to watch the greedy algorithm in action.
Uncolored
Red
Blue
Green
Being checked