A 2-pire Map

Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
The four-color map theorem states that any map can be colored with four colors so that no two neighboring regions share a color. For a proof that four colors are necessary, consider a tetrahedron. If the faces are numbered 1 to 4, any two of these faces touch each other.
[more]
Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA
Snapshots
Details
detailSectionParagraphPermanent Citation
"A 2-pire Map"
http://demonstrations.wolfram.com/A2PireMap/
Wolfram Demonstrations Project
Published: March 7 2011