MATHEMATICS (MS 1-278)
In how many ways, with c colors, can a simple chain of 1 links be colored, no two adjacent links being colored alike? In how may ways, with c + l colors, can a simple chain of I + l links be colored so that all adjacent links are colored differently?
graphics, topical (topics or topology), fourcolor problem (Map), Mathematics
MATHEMATICS / TOPICAL GEOMETRY
Seven pages added from fragments; one page from MS. 839