Every planar map is four colorable. Part II: Reducibility

1977702 citationsJournal Articlebronze Open Access

Authors

K. I. Appel · University of Illinois System

Wolfgang Haken · University of Illinois Urbana-Champaign

Abstract

computer of the University Administrative Data Processing Unit. We should like to especially thank the consultants and systems programmers at C.S.O. for their excellent help and advice and the

Topics & Keywords

3D Modeling in Geospatial Applications Computational Geometry and Mesh Generation

Publication Details

Published in: Illinois Journal of Mathematics

Volume 21, Issue 3

DOI: 10.1215/ijm/1256049012

Field-Weighted Citation Impact: 14.91

Command Palette

Every planar map is four colorable. Part II: Reducibility

Authors

Abstract

Topics & Keywords

Publication Details