ALEX Resources

   View Standards     Standard(s): [MA2019] FM-19 (9-12) 19 :

19. Use vertex-coloring, edge-coloring, and matching techniques to solve application-based problems involving conflict.

Examples: Use graph-coloring techniques to color a map of the western states of the United States so that no adjacent states are the same color, determining the minimum number of colors needed and why no fewer colors may be used; use vertex colorings to determine the minimum number of zoo enclosures needed to house ten animals given their cohabitation constraints; use vertex colorings to develop a time table for scenarios such as scheduling club meetings or for housing hazardous chemicals that cannot all be safely stored together in warehouses.

Students will color the vertices of a network/graph using as many colors as possible and as few colors as possible.  

   View Standards     Standard(s): [MA2019] FM-19 (9-12) 19 :

19. Use vertex-coloring, edge-coloring, and matching techniques to solve application-based problems involving conflict.

Examples: Use graph-coloring techniques to color a map of the western states of the United States so that no adjacent states are the same color, determining the minimum number of colors needed and why no fewer colors may be used; use vertex colorings to determine the minimum number of zoo enclosures needed to house ten animals given their cohabitation constraints; use vertex colorings to develop a time table for scenarios such as scheduling club meetings or for housing hazardous chemicals that cannot all be safely stored together in warehouses.

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.

   View Standards     Standard(s): [MA2019] FM-19 (9-12) 19 :

19. Use vertex-coloring, edge-coloring, and matching techniques to solve application-based problems involving conflict.

Examples: Use graph-coloring techniques to color a map of the western states of the United States so that no adjacent states are the same color, determining the minimum number of colors needed and why no fewer colors may be used; use vertex colorings to determine the minimum number of zoo enclosures needed to house ten animals given their cohabitation constraints; use vertex colorings to develop a time table for scenarios such as scheduling club meetings or for housing hazardous chemicals that cannot all be safely stored together in warehouses.

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.