research
∙
06/21/2001
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
We show that computing the lexicographically first four-coloring for pla...
share
research
∙
06/19/2001
