A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

André Große Jörg Rothe Gerd Wechsung

Published in: CoRR (2001)

Keyphrases

planar graphs
worst case
computational complexity
upper bound
random walk
knapsack problem