Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Every Planar Map is Four Colorable
 
Every Planar Map is Four Colorable
eBook ISBN:  978-0-8218-7686-2
Product Code:  CONM/98.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Every Planar Map is Four Colorable
Click above image for expanded view
Every Planar Map is Four Colorable
eBook ISBN:  978-0-8218-7686-2
Product Code:  CONM/98.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 981989; 741 pp
    MSC: Primary 05;

    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.

  • Table of Contents
     
     
    • Chapters
    • Introduction
    • Part I: Discharging
    • Part II: Reducibility
    • Appendix to Part II
    • Supplement to Part I
    • Supplement to Part II
    • Corresponding Class Check Lists
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 981989; 741 pp
MSC: Primary 05;

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.

  • Chapters
  • Introduction
  • Part I: Discharging
  • Part II: Reducibility
  • Appendix to Part II
  • Supplement to Part I
  • Supplement to Part II
  • Corresponding Class Check Lists
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.