A fast parallel coloring of planar graphs with five colors
- 20 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1) , 51-53
- https://doi.org/10.1016/0020-0190(87)90092-5
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- A batching method for coloring planar graphsInformation Processing Letters, 1978
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977