By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy
To color any map on the sphere or the plane requires at most six-colors. This number can easily be reduced to five, and the four-color theorem demonstrates that the necessary number is, in fact, four.
four-color theorem | Heawood conjecture | map coloring
Back to List | POWERED BY THE WOLFRAM LANGUAGE