Two players, Phil and Emmy, take turns coloring nodes of a graph. Connected
nodes must always be different colors. The game continues until no more nodes
can be colored. Phil wins if all the nodes are filled, and Emmy wins if some
of the nodes are empty.