A new proof of Grünbaum's 3 color theorem

Discrete Mathematics

Volumn 169, Issue 1-3, 1997, Pages 177-183

  Borodin, O V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043048102     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00984-5     Document Type: Article

References (10)

1. V.A. Aksenov, On continuation of 3-colouring of planar graphs (in Russian), Diskret. Anal. Novosibirsk 26 (1974) 3-19.
2. O.V. Borodin, A proof of Grünbaum's conjecture on acyclic 5-colourability of planar graphs (in Russian), Dokl. Akad. Nauk SSSR 231 (1976) 18-20.
3. O.V. Borodin, On cyclic colorings of planar graphs, Discrete Math. 25 (1979) 211-236.
4. O.V. Borodin, Solution of Ringel's problems on vertex-face colouring of plane graphs and colouring of 1-planar graphs (in Russian), Diskret. Anal. Novosibirsk 41 (1984) 12-26.
5. H. Grötzsch, Ein Dreifarbensatz für dreikreisfrei Netze auf der Kugel, Wiss. Z. Martin-Luther Univ. Halle-Wittenberg, Math.-Nat. Reihe 8 (1958) 109-120.
6. Grünbaum, Grötzsch's theorem on 3-coloring. Michigan Math. J. 10 (1963) 303-310.
7. T.R. Jensen and B. Toft, Graph coloring problems, Wiley, New York, 1995.
8. O. Ore, The Four-Colour Problem, Academic Press, 1967.
9. H. Sachs, Einfürung in die Theorie der endlichen Graphen, II, Teubner, Leipzig, 1972.
10. R. Steinberg, The state of the three color problem, in: J. Gimbel, J. W. Kennedy and L. V. Quintas, eds. Quo Vadis, Graph Theory? Ann. Discrete Math. 55 (1993) 211-248.