Curated OER
The Notorious Four-Color Problem
Take a walk through time, 1852 to 2005, following the mathematical history, development, and solution of the Four-Color Theorem. Learners take on the role of cartographers to study a United States map that is to be colored. One rule: no...
Other
Elmwood Park High School: Vertex Edge Graphs
In this Unit, you will use vertex-edge graphs and Euler Circuits to help find optimum paths. Included are two lessons that help you develop the understanding and skill needed to solve problems about optimum paths and conflicts.
Other
Tutorials Point: Graph Theory Coloring
Graph coloring is nothing but a simple way of labeling graph components such as vertices, edges, and regions under some constraints. This site introduces you to graph coloring and its applications in the real world.
Other
Geeks for Geeks: Graph Coloring|set 1 (Introduction and Applications)
Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints. This source looks at different applications of graph coloring.