Théorème des 4 couleurs Four colors theorem
PAGES WEB
This page gives a brief summary of a new proof of the Four Color Theorem and a four-coloring algorithm .
<http://www.math.gatech.edu/~thomas/FC/fourcolor.html>
<http://www.ics.uci.edu/~eppstein/junkyard/color.html>
<http://www.cs.ualberta.ca/~joe/Coloring/>
<http://www.math.utah.edu/~alfeld/math/4color.html>
<http://en.wikipedia.org/wiki/Four_color_theorem>

PAGES PERSONNELLES - HOME PAGES
School of Mathematics Georgia Institute of Technology Atlanta, Georgia
<http://www.math.gatech.edu/~thomas/>
<http://theory.lcs.mit.edu/~dmjones/STOC/Authors/sandersdanielp.html>

APPLICATIONS
<http://han-en-jana.rc.tudelft.nl/fcp/index.htm>

LOGICIELS - SOFTWARES
This directory contains the programs and data that serve as supplements to the paper `The Four-Colour Theorem' by N. Robertson, D. P. Sanders, P. D. Seymour and R. Thomas, J. Combin. Theory Ser. B 70 (1997), 2-44. They naturally fall into two parts, Reducibility and Discharging.
<ftp://ftp.math.gatech.edu/pub/users/thomas/four/>
Joseph Culberson Department of Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2H1
<http://www.cs.ualberta.ca/~joe/Coloring/Colorsrc/index.html>
<http://mat.gsia.cmu.edu/COLOR/color.html>

THÉORIE - THEORY
Sujet proposé par Georges Gonthier
<http://www.enseignement.polytechnique.fr/profs/informatique/Georges.Gonthier/pi2000/pro/gonthier/index.html>

SUJETS - SUBJECTS
A Rough Critique of Dharwadker's Four-Color Conjecture Proof Attempt
by Steven H. Cullinane
<http://m759.freeservers.com/rough.html>

DOCUMENTS - PAPERS
<ftp://ftp.math.gatech.edu/pub/users/thomas/fcdir/npfc.ps>
Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas
<http://www.emis.de/journals/ERA-AMS/1996-01-003/1996-01-003.html>
Alex Lopez-Ortiz
<http://www.cs.unb.ca/~alopez-o/math-faq/mathtext/node27.html>
<http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/The_four_colour_theorem.html>

JOURNAUX - LETTERS
by Neil Robertson, Daniel P. Sanders, Paul Seymour, and Robin Thomas
Electronic research announcements of the American Mathematical Society Volume 2, Number 1, August 1996
The four-colour theorem, that every loopless planar graph admits a vertex-colouring with at most four di erent colours, was proved in 1976 by Appel and Haken, using a computer. Here we announce another proof, still using a computer, but simpler than Appel and Haken's in several respects.
<http://www.ams.org/journals/era/1996-02-01/>

HISTORIQUES - HISTORY
The Four Colour Conjecture first seems to have been made by Francis Guthrie. He was a student at University College London where he studied under De Morgan.
Article by: J J O'Connor and E F Robertson
<http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/The_four_colour_theorem.html>

BIOGRAPHIES
<http://io.uwinnipeg.ca/~ooellerm/guthrie/FourColor.html>

RÉFÉRENCES - BIBLIOGRAPHIES
<http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/References/The_four_colour_theorem.html>

QUESTIONS - FAQ
<http://www.cs.ruu.nl/wais/html/na-dir/sci-math-faq/fourcolour.html>
Actualités
Advertising :
If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document,
please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement :
Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes
et sur plusieurs pages.
Les commentaires sont généralement des courts extraits des pages référencées.
Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :
Les mises à jour demandées sont réalisées dès que possible et,
sauf si c'est nécessaire, aucun message de réponse n'est expédié.
Merci de m'écrire.
Copyright © 1999-2009 Jean-Paul Davalan - Reproduction interdite.
|