Advertisement

A linear algorithm for five-coloring a planar graph

  • N. Chiba
  • T. Nishizeki
  • N. Saito
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 108)

Abstract

A simple linear algorithm is presented for coloring planar graphs with at most five colors. The algorithm employs a recursive reduction of a graph involving the deletion of a vertex of degree 6 or less possibly together with the identification of its several neighbors.

References

  1. [1]
    B. Carre, Graphs and Network, Clarendon Press, Oxford, 1979.Google Scholar
  2. [2]
    N. Chiba, T. Nishizeki and N. Saito, An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs, submitted to SIAM J. on Comput., 1980.Google Scholar
  3. [3]
    M. R. Garey, D. S. Jhonson and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 237–267, 1976.Google Scholar
  4. [4]
    R. J. Lipton and R. E. Miller, A batching method for coloring planar graphs, Information Processing Letters, 7,4, 185–188, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • N. Chiba
    • 1
  • T. Nishizeki
    • 1
  • N. Saito
    • 1
  1. 1.Department of Electrical Communications Faculty of EngineeringTohoku UniversitySendaiJapan

Personalised recommendations