Can I read A Digest of the Four Color Theorem on EtoBox?

A Digest of the Four Color Theorem by Frank R. Bernhart is a Computer Science article available to read on EtoBox.

What is A Digest of the Four Color Theorem about?

## Abstract A major event in 1976 was the announcement that the Four Color Conjecture (4CC) had at long last become the Four Color Theorem (4CT). The proof by W. Haken, K. Appel, and J. Koch is published in the __Illinois Journal of Mathematics__, and their two‐part article outlines the nature and reliability of the solution. The first section is a readable and informative historical survey. The reminder will appeal chiefly to specialists in graph theory. Although the logic of attack is relatively simple, the need to examine an immense number of individual cases is frustrating. Hopefully this first breakthrough will pave the way for a short elegant proof. For the second section, 1200 hours of computer time was required to verify the 4‐color reducibility of nearly 1900 configurations. At this time there is no good way to condense the proof. In this digest we offer an exposition of the main ideas. The first and the last parts are intended for a general audience, but the intermediate sections assume more knowledge of graph theory proper. The usual statement of the 4CC goes as follows: “All maps on the sphere or plane can be colored with four colors so that neighboring regions are neve

Who reads A Digest of the Four Color Theorem?

Author

Frank R. Bernhart

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)

Published

1977

Language

EN

Field

Computer Science (Physical Sciences)