ComputingComputer ScienceAlgorithmsComputational GeometryData StructuresColor ModelsColor Space RepresentationGeometry ProcessingGraph ColoringGraph TheoryApproximation Algorithms For ColoringQuadtreesTree Algorithms
1
Efficiently four-coloring planar graphs
Neil Robertson, Daniel P. Sanders, Paul Seymour et al. · 1996 · 104 citations