1. Solving a scheduling problem such as the one that follows can be accomplished by constructing a related graph and then coloring it in a way that adjacent vertices have different colors. Explore the problem of graph coloring in the Graph Coloring applet.