Heuristics for rapidly four-coloring large planar graphs
Authors:
- 1 June 1991
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 6 (1-6) , 869-891
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A generalized implicit enumeration algorithm for graph coloringCommunications of the ACM, 1985
- On linear-time algorithms for five-coloring planar graphsInformation Processing Letters, 1984
- A linear 5-coloring algorithm of planar graphsJournal of Algorithms, 1981
- New methods to color the vertices of a graphCommunications of the ACM, 1979
- A graph coloring algorithm for large scheduling problemsJournal of Research of the National Bureau of Standards, 1979
- A digest of the four color theoremJournal of Graph Theory, 1977
- An attempt to understand the four color problemJournal of Graph Theory, 1977
- GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.1972
- A group of operations on a partially colored mapBulletin of the American Mathematical Society, 1935
- On the Geographical Problem of the Four ColoursAmerican Journal of Mathematics, 1879