3-Topology-Problems-Map

four-color theorem

Four colors can color two-dimensional maps so no two countries with common boundary have same color {map problem} {four-color theorem}|. Kenneth Appel and Wolfgang Haken proved the four-color theorem [1976], by enumerating possibilities and then checking all by computer. One-dimensional line maps need two colors. Three-dimensional maps need six colors.

Related Topics in Table of Contents

3-Topology-Problems

Drawings

Drawings

Contents and Indexes of Topics, Names, and Works

Outline of Knowledge Database Home Page

Contents

Glossary

Topic Index

Name Index

Works Index

Searching

Search Form

Database Information, Disclaimer, Privacy Statement, and Rights

Description of Outline of Knowledge Database

Notation

Disclaimer

Copyright Not Claimed

Privacy Statement

References and Bibliography

Consciousness Bibliography

Technical Information

Date Modified: 2022.0225