On linear-time algorithms for five-coloring planar graphs
- 26 November 1984
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 19 (5) , 219-224
- https://doi.org/10.1016/0020-0190(84)90056-5
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- A batching method for coloring planar graphsInformation Processing Letters, 1978
- Every planar map is four colorable. Part I: DischargingIllinois Journal of Mathematics, 1977