American Mathematical Monthly · 1980 · 47 citations · 4 references
Image Size AdditionalGeometric Graph TheoryEngineeringGraph TheoryFour-color Theorem.—editorsColor ReproductionColorizationExtremal Graph TheoryCombinatory AnalysisColor TheoryD. S. HendersonEducationPhilosophical ImplicationsComputer ScienceDiscrete MathematicsCombinatorial OptimizationColor ConstancyRace
Click to increase image sizeClick to decrease image size Additional informationNotes on contributorsE. R. SwartEdward R. Swart received a D.Sc. from the University of Pretoria in 1957 and a Ph.D. from the University of Witwatersrand under D. S. Henderson in 1977. He was formerly at the University of Rhodesia, where he was Director of the Gulbenkian Centre 1966–77, Dean of the Faculty of Science 1973–75, Professor and Head of the Department of Computer Science 1975–77. He is also past President of the Rhodesia Scientific Association 1973–74. He is now a Professor in the Department of Combinatorics and Optimization at the University of Waterloo. His main research interest is in graph-theoretic problems concerned with colorings and flows. He was one of the five authors cited by Haken and Appel in their initial announcement of the proof of the four-color theorem.—Editors
4
Allan Calder · Scientific American · 1979 · 21 citations
An attempt to understand the four color problem
Wolfgang Haken · Journal of Graph Theory · 1977 · 15 citations