Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Almost all k-colorable graphs are easy to color
Journal of Algorithms
Every planar graph is 5-choosable
Journal of Combinatorial Theory Series B
Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
A short solution of Heawood's empire problem in the plane
Discrete Mathematics
New methods to color the vertices of a graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
We propose a new model for cartographic map coloring for use in Geographical Information Systems. Map coloring motivated the famous four-color problem in Mathematics. The published proofs of the four-color theorem yield impractical polynomial-time algorithms. Actual political maps often require generalizations to the standard four-coloring problem given the topology of some regions. We allow each region to have m disjoint pieces, which is Heawood's m-pire problem. We also count node adjacency between regions, i.e., two regions are adjacent if they share a common point. The adjacency graphs using node adjacency are known as map graphs. By combining m-pires with node and island adjacency, we formulate a new model to handle actual GIS instances. We implemented Brélaz's Dsatur heuristic, since no specific algorithm exists for coloring our resulting cartographic graphs. The choice works well in practice and we discuss the details of the implementation in TransCAD®.