Every Planar Map is Four Colorable

American Mathematical Society, 31 déc. 1989 - 741 pages
0 Avis
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.

Avis des internautes - Rédiger un commentaire

Aucun commentaire n'a été trouvé aux emplacements habituels.

Autres éditions - Tout afficher

Références à ce livre

Constraint Processing
Rina Dechter
Aucun aperçu disponible - 2003
Tous les résultats Google Recherche de Livres »

Informations bibliographiques