Planar graphs without cycles of length from 4 to 7 are 3-colorable. (English) Zbl 1056.05052

Summary: Planar graphs without cycles of length from 4 to 7 are proved to be 3-colorable. Moreover, it is proved that each proper 3-coloring of a face of length from 8 to 11 in a connected plane graph without cycles of length from 4 to 7 can be extended to a proper 3-coloring of the whole graph. This improves on the previous results on a long standing conjecture of Steinberg.


05C15 Coloring of graphs and hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
Full Text: DOI


[1] Abbott, H.L.; Zhou, B., On small faces in 4-critical graphs, Ars combin., 32, 203-207, (1991) · Zbl 0755.05062
[2] Borodin, O.V., To the paper of H.L. abbott and B. zhou on 4-critical planar graphs, Ars combin., 25, 211-236, (1979) · Zbl 0406.05031
[3] Borodin, O.V., Structural properties of plane graphs without adjacent triangles and an application to 3-colorings, J. graph theory, 21, 2, 183-186, (1996) · Zbl 0838.05039
[4] Jensen, T.R.; Toft, B., Graph coloring problems, (1995), Wiley New York · Zbl 0971.05046
[5] Sanders, D.P.; Zhao, Y., A note on the three color problem, Graphs combin., 11, 91-94, (1995) · Zbl 0824.05023
[6] R. Steinberg, The state of the three color problem, in: J. Gimbel, J.W. Kennedy, L.V. Quintas (Eds.), Quo Vadis, Graph Theory? Annals of Discrete Mathematics, vol. 55, 1993, pp. 211-248. · Zbl 0791.05044
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.