eBook

Mathigon: Graphs and Networks: Map Colouring

Curated by ACT

This lesson focuses on map coloring and the problem of proving that 4 colors would work for all maps. Francis Guthrie had to color a map of counties in England. He observed that four colors seemed to suffice for any map he tried, but he was not able to find a proof that worked for all maps. This turned out to be an extremely difficult problem, and became known as the four color theorem.

3 Views 0 Downloads
Classroom Considerations
  • Knovation Readability Score: 4 (1 low difficulty, 5 high difficulty)
  • The intended use for this resource is Instructional|practice