A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs

  • Zhi-Zhong Chen
  • Mitsuharu Kouno
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2747)


A graph G is 1-planar if it can be embedded in the plane in such a way that each edge crosses at most one other edge. Borodin showed that 1-planar graphs are 6-colorable, but his proof only leads to a complicated polynomial (but nonlinear) time algorithm. This paper presents a linear-time algorithm for 7-coloring 1-planar graphs (that are already embedded in the plane). The main difficulty in the design of our algorithm comes from the fact that the class of 1-planar graphs is not closed under the operation of edge contraction. This difficulty is overcome by a structure lemma that may find useful in other problems on 1-planar graphs. This paper also shows that it is NP-complete to decide whether a given 1-planar graph is 4-colorable. The complexity of the problem of deciding whether a given 1-planar graph is 5-colorable is still unknown.


Edge Contraction Critical Edge Small Vertex Distinct Neighbor Critical Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Appel, K., Haken, W.: Every planar map is four colorable, Part I: Discharging. Illinois J. Math. 21, 429–490 (1977)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Appel, K., Haken, W., Koch, J.: Every planar map is four colorable, Part II: Reducibility. Illinois J. Math. 21, 491–567 (1977)zbMATHMathSciNetGoogle Scholar
  3. 3.
    Archdeacon, D.: Coupled colorings of planar graphs. Congres. Numer. 39, 89–94 (1983)MathSciNetGoogle Scholar
  4. 4.
    Borodin, O.V.: Solution of Ringel’s problems on vertex-face coloring of planar graphs and coloring of 1-planar graphs (in Russian). Met. Discret. anal., Novosibirsk 41, 12–26 (1984)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Borodin, O.V.: A new proof of the 6 color theorem. J. Graph Theory 19, 507–521 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chen, Z.-Z.: Approximation algorithms for independent sets in map graphs. J. Algorithms 41, 20–40 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: Proc. ACM STOC 1998, pp. 514–523 (1998)Google Scholar
  8. 8.
    Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49, 127–138 (2002)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Chiba, N., Nishizeki, T., Saito, N.: A linear 5-coloring algorithm of planar graphs. J. Algorithms. 8, 470–479 (1981)MathSciNetGoogle Scholar
  10. 10.
    Chrobak, M., Diks, K.: Two algorithms for coloring planar graphs with 5 colors. Tech. Report, Columbia University (January 1987) Google Scholar
  11. 11.
    Frederickson, G.N.: On linear-time algorithms for five-coloring planar graphs. Inform. Process. Lett. 19, 219–224 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Matula, D.W., Shiloach, Y., Tarjan, R.E.: Two linear-time algorithms for fivecoloring a planar graph. Tech. Report STAN-CS-80-830, Stanford University (November 1980) Google Scholar
  13. 13.
    Ore, O., Plummer, M.D.: Cyclic coloration of planar graphs. In: Recent Progress in Combinatorics (Proc. 3rd Waterloo Conf. on Combinatorics, 1968), pp. 287–293. Academic Press, New York (1969)Google Scholar
  14. 14.
    Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamburg 29, 107–117 (1965)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Williams, M.H.: A linear algorithm for colouring planar graphs with five colours. Comput. J. 28, 78–81 (1985)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Zhi-Zhong Chen
    • 1
  • Mitsuharu Kouno
    • 1
  1. 1.Dept. of Math. Sci.Tokyo Denki Univ.SaitamaJapan

Personalised recommendations