Four Color Theorem
From Math Images
- Four coloring and graph representation of the United States.
Basic DescriptionHow many colors are needed to color the territories of a map, if all the territories that share a border must be of different colors?
It turns out that only four colors are needed to color such a two-dimensional map. It has taken over a century for a correct proof of this fact to emerge, and the proof can currently only be carried out with the aid of computers. An example of a map colored with only 4 colors is the map of The United States on this page's main image.
A More Mathematical Explanation
Map coloring is an application of Graph Theory, the study of graphs. A graph is informally a collect [...]
Map coloring is an application of Graph Theory, the study of graphs. A graph is informally a collection of points, known as vertices, connected by lines, known as edges. This p
- There are currently no teaching materials for this page. Add teaching materials.
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.