Kempe revisited

American Mathematical Monthly

Volumn 105, Issue 2, 1998, Pages 170-174

  Hutchinson, Joan ^a   Wagon, Stan ^a  

^a MACALESTER COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032330737     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.2307/2589650     Document Type: Article

References (9)

1. N. L. Biggs, E. K. Lloyd, and R. J. Wilson, Graph Theory, 1736-1936, Oxford Univ. Press, Oxford, 1976.
2. E. B. Burger and F. Morgan, Fermat's last theorem, the four color conjecture, and Bill Clinton for April Fools' Day, this MONTHLY 104 (1997) 246-255.
3. A. Errera, Du Colorage des Cartes et de Quelques Questions d'Anaysis Situs, Thesis, Gauthier-Villars, Paris, 1921, 66 pp.
4. J. P. Hutchinson and S. Wagon, The four-color theorem, Mathematica in Education and Research 6:1 (1997) 42-51.
5. I. Kittell, A group of operations on a partially colored map, Bull. Amer. Math. Soc. 41 (1935) 407-413.
6. D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in: Graph Theory and Computing (R. C. Read, ed.), Academic Press, New York, 1972, pp. 109-122.
7. C. A. Morgenstern and H. D. Shapiro, Heuristics for rapidly four-coloring planar graphs, Algorithmica 6 (1991) 869-891.
8. N. Robertson, D. P. Sanders, P. Seymour, and R. Thomas, A new proof of the four-colour theorem, Electron Res. Announcements, Amer. Math. Soc. 2 (1996) 17-25
9. T. L. Saaty and P. C. Kainen, The Four Color Problem, McGraw-Hill, New York, 1977.