Coloring a graph is trivial, just give every node its own color. The NP-complete problems are for finding the optimal number of colors, or determining if the g

Coloring a graph is trivial, just give every node its own color. The NP-complete problems are for finding the optimal number of colors, or determining if the graph can be colored using a set small number of colors. Erin's solution aims for a small number of colors, but doesn't try to be the optimal number.