On Linear-Time Algorithms for Five-Coloring Planar Graphs

@article{Frederickson1984OnLA,
  title={On Linear-Time Algorithms for Five-Coloring Planar Graphs},
  author={Greg N. Frederickson},
  journal={Inf. Process. Lett.},
  year={1984},
  volume={19},
  pages={219-224}
}
It is well known that the vertices of a planar graph can be colored with no more than four colors [l]. However, the rather detailed proof of this fact leads to a @(n*) algorithm for determining such a coloring. To yield faster algorithms, several authors have considered generating a fivecoloring rather than a four-coloring [4]. Recently, two different approaches to five-coloring planar graphs have been shown to yield linear-time algorithms [5,3]. Each approach involves the clever exploitation… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…