On the Problem of Map-Coloring and on Geometrical Topics, in General
Resource tools
File information | File size | Options |
Original JPG File734 × 1024 pixels (0.75 MP) 6.2 cm × 8.7 cm @ 300 PPI | 245 KB | Download |
Screen573 × 800 pixels (0.46 MP) 4.9 cm × 6.8 cm @ 300 PPI | 62 KB | Download |
PreviewScreen Preview | 62 KB | View |
Manuscript Metadata
Resource ID
4944
Access
Open
Contributed by
Frederik Wellmann
date (Robin)
1899/1900
type of material
A. MS.
description
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.
general index
graphics, topical (topics or topology), fourcolor problem (Map), Mathematics
pagination
pp. 1-10, plus variants and many other attempts (82 pp. in all), none going beyond p. 10
Date
1899/1900
number
MS0154_022
abbreviated title
(MC, PMC, Map)
date (Robin)
1899/1900
Search for similar resources