Bibliographie
K. Appel & W. Haken, « Every Planar Graph is Four Colorable », in Illinois J. Math., 21, pp. 429-567, 1977
C. Berge, Théorie des graphes et ses applications, 3e éd., Gauthier-Villars, Paris, 1983
Graphes et hypergraphes, Dunod, Paris, 2e éd. 1973
C. Berge,Graphs, Elsevier Science Publ., New York, 1992
C. Berge & V. Chvátal éd., Topics on Perfect Graphs, Annals of Discrete Maths, 21, North Holland, Amsterdam, 1984
N. L. Biggs, E. K. Lloyd & R. J. Wilson, Graph Theory : 1736-1936, Clarendon Press, Oxford, 1977
V. Chachra, Applications of Graph Theory Algorithms, North-Holland-New York, 1979
N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall, Englewood Cliffs, 1974
F. Harary, R. Z. Normann & D. Cartwright, Introduction à la théorie des graphes orientés. Modèles structuraux, Dunod, 1968
R. Nelson & J. R. Wilson, Graph Colourings, Halsted Press, New York, 1990
O. Ore, Graphs and Their Uses, Mathematical Association of America, Washington (D.C.), 1990
Theory of Graphs, A.M.S., Providence, repr. of 1962, ibid., 1987
N. Robertson, D. P. Sanders, P. Seymour & R. Thomas, « A New Proof of the Four-Colour Theorem », in Electronic Research Announcements of the American Mathematical Society, vol. 2, n° 1, août 1996 (électronique)
R. J. Wilson, Introduction to Graph Theory, 3e éd., Wiley, New York, 1986.
Retour en haut
… pour nos abonnés, l'article se prolonge sur 5 pages…
