A linear algorithm for five-coloring a planar graph
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.
- B. Carre, Graphs and Network, Clarendon Press, Oxford, 1979.Google Scholar
- 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
- M. R. Garey, D. S. Jhonson and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 237–267, 1976.Google Scholar
- R. J. Lipton and R. E. Miller, A batching method for coloring planar graphs, Information Processing Letters, 7,4, 185–188, 1978.Google Scholar