Graph Coloring


The graph coloring problem, involves assigning colors to vertices in a graph such that adjacent vertices have distinct colors. This problem arises in a number of scientific and engineering applications.

In our applet below your goal is to color the graph using a minimum number of colors. To color a vertex drag a color puck on top of a vertex. The Reset button will clear the colors. The New Graph button will load a new graph.


Number of different colors used = 0