Every planar map is four colorable

Every planar map is four colorable

by Appel, Kenneth I.

Type Book
Rate 0.0 /5
Details
Files
Reviews
Download

Title Statements

  • Full title :Every planar map is four colorable / Kenneth Appel, and Wolfgang Haken.

Edition Statements

  • Publication Date:©1989.

Publication Statements

The Physical Object

  • Description:xv, 741 pages : : illustrations ; : 25 cm.

Edition Identifiers

  • ISBN:0821851039, 9780821851036
  • oclc:ocm19921606
  • LC Classification:QA612.18
  • Dewey Decimal:511/.5

Table of Contents

Introduction. History; C- and D-reducibility; Unavoidable sets and our discharging procedure; Details of the proof; Our checking procedure -- Part I. Discharging. 1. Introduction; 2. The discharging procedure; 3. The set U of reducible configurations; 4. Probabilistic considerations; 5. Possible improvements; Bibliography -- Part II. Reducibility. 1. Introduction; 2. The computer programs; 3. Immersion reducibility; 4. The unavoidable set U of reducible configurations -- Appendix to Part II -- Supplement to Part I -- Supplement to Part II.

Read More ↓

Subjects

four color problem Problème des quatre couleurs Vierfarbensatz Vierkleurenprobleem

Writers

Appel, Kenneth I. Haken, Wolfgang

More from this Series

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Every Planar Map is Four Colorable -- (.djvu)

    DJVU · 12.2 MB · updated
    Login →
Log in to request a copy