Students will color the vertices of a network/graph using as many colors as possible and as few colors as possible.
This is a practice problem for graph theory conflict mapping using coloring. Students are presented with a problem dealing with scheduling clubs and are asked to create a conflict map using google drawings. They will color the graph to determine the fewest club periods needed to avoid overlapping students.
Students will use a graph created by using color theory and conflict resolution to solve a scheduling problem. They will provide an explanation for their reasoning.