Every Planar Map is Four Colorable

Front Cover
American Mathematical Society, Dec 31, 1989 - Mathematics - 741 pages
0 Reviews
In this volume, the authors present their 1972 proof of the celebrated Four Color Theorem in a detailed but self-contained exposition accessible to a general mathematical audience. An emended version of the authors' proof of the theorem, the book contains the full text of the supplements and checklists, which originally appeared on microfiche. The thiry-page introduction, intended for nonspecialists, provides some historical background of the theorem and details of the authors' proof. In addition, the authors have added an appendix which treats in much greater detail the argument for situations in which reducible configurations are immersed rather than embedded in triangulations. This result leads to a proof that four coloring can be accomplished in polynomial time.

What people are saying - Write a review

We haven't found any reviews in the usual places.

Other editions - View all

References to this book

Constraint Processing
Rina Dechter
No preview available - 2003
All Book Search results »

Bibliographic information