An Approximate Restatement of the Four-Color Theorem

  title={An Approximate Restatement of the Four-Color Theorem},
  author={Atish Das Sarma and Amita Gajewar and Richard J. Lipton and Danupon Nanongkai},
  journal={J. Graph Algorithms Appl.},
The celebrated Four Color Theorem was first conjectured in the 1850’s. More than a century later Appel and Haken [1] were able to find the first proof. Previously, there had been many partial results, and many false proofs. Appel and Haken’s famous proof has one “drawback”: it makes extensive use of computer computation. More recently Robertson, Sanders, Seymour and Thomas [18] created another proof of the Four Color Theorem. However, their proof, while simplifying some technical parts of the… CONTINUE READING
0 Citations
27 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 27 references

Note on a theorem in geometry of position

  • P. G. Tait
  • Trans. Roy. Soc. Edinburgh 29, pages 657–660,
  • 1880
Highly Influential
5 Excerpts

Frieze and Mark Jerrum . Improved approximation algorithms for maxcut and max bisection

  • M. Alan
  • Graph Theory ( Graduate Texts in Mathematics )
  • 2005

Graph Theory (Graduate Texts in Mathematics)

  • Reinhard Diestel
  • 2005
2 Excerpts

Graph coloring problems

  • T. R. Jensen, B. Toft
  • Wiley&Sons, New York,
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…