4966
Open
Frederik Wellmann
1899/1900
A. MS.
The problem of map-coloring is stated as follows: "To determine demonstratively the smallest number of colors that will suffice so as to color any map whatever which can be drawn on a given surface, that no two confine regions (that is, two regions having a common boundary-line) shall have the same color." See CSP W. E. Story correspondence, 12/29/00.
graphics, topical (topics or topology), fourcolor problem (Map), Mathematics
pp. 1-10, plus variants and many other attempts (82 pp. in all), none going beyond p. 10
1899/1900
MS0154_044
(MC, PMC, Map)
1899/1900