All challenges

Color a large graph with three colors while minimizing conflicts.

Assign three colors to minimize conflicting graph edges.

Color a graph with as few colors as possible.

Transform a binary graph coloring to a target coloring using simultaneous neighbor-copy steps.