THE COLOR PROBLEM.
Abstract
It is known that geographical maps of an area, colored in such a way that any two subdivisions which touch along a boundary have different colors, can be colored without using more than four distinct colors. The color problem is the determination of the number of colors that are necessary and sufficient to color maps embedded in any topological surface. Some results related to the color problem are proved. Conjectures implying the four-color conjecture are developed.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1965
- Accession Number
- AD0616382
Entities
People
- Benjamin Edward Waller Iii.
Organizations
- Vanderbilt University