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.
Chapter PDF
Similar content being viewed by others
References
B. Carre, Graphs and Network, Clarendon Press, Oxford, 1979.
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.
M. R. Garey, D. S. Jhonson and L. Stockmeyer, Some simplified NP-complete graph problems, Theor. Comput. Sci. 1, 237–267, 1976.
R. J. Lipton and R. E. Miller, A batching method for coloring planar graphs, Information Processing Letters, 7,4, 185–188, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chiba, N., Nishizeki, T., Saito, N. (1981). A linear algorithm for five-coloring a planar graph. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive