A linear 5-coloring algorithm of planar graphs
References (4)
- et al.
Some simplified NP-complete graph problems
Theor. Comput. Sci.
(1976) - et al.
A batching method for coloring planar graphs
Inform. Process. Lett.
(1978)
There are more references available in the full text version of this article.
Cited by (43)
Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
2015, Theoretical Computer ScienceImproved induced matchings in sparse graphs
2010, Discrete Applied MathematicsThe d-precoloring problem for k-degenerate graphs
2007, Discrete MathematicsSystem to place observers on a polyhedral terrain in polynomial time
2000, Image and Vision ComputingGuarding polyhedral terrains
1997, Computational Geometry: Theory and ApplicationsParallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
1994, Journal of Parallel and Distributed Computing
Copyright © 1981 Published by Elsevier Inc.