A sufficient condition for planar graphs to be 3-colorable

Journal of Combinatorial Theory. Series B

Volumn 88, Issue 1, 2003, Pages 17-27

  Borodin, O V ^a   Raspaud, A ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038287412     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0095-8956(03)00025-X     Document Type: Article

References (5)

1. M.R. Garey, D.S. Johnson, L.J. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
2. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin Luther Univ. Halle Wittenberg, Math.-Nat. Reihe 8 (1959) 109-120.
3. I. Havel, On a conjecture of B. Grünbaum, J. Combin. Theory 7 (1969) 184-186.
4. T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, New York, 1995.
5. R. Steinberg, The state of the three color problem, in: J. Gimbel, JW. Kennedy, L.V. Quintas (Eds.), Quo Vadis, Graph Theory? Ann. Discrete Math. 55 (1993) 211-248.