Elsevier

Journal of Algorithms

Volume 2, Issue 4, December 1981, Pages 317-327
Journal of Algorithms

A linear 5-coloring algorithm of planar graphs

https://doi.org/10.1016/0196-6774(81)90031-6Get rights and content

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 (4)

There are more references available in the full text version of this article.

Cited by (43)

  • Improved induced matchings in sparse graphs

    2010, Discrete Applied Mathematics
  • Guarding polyhedral terrains

    1997, Computational Geometry: Theory and Applications
View all citing articles on Scopus
View full text