A sufficient condition for planar graphs to be 3-colorable.

Oleg V. Borodin André Raspaud

Published in: J. Comb. Theory, Ser. B (2003)

Keyphrases

sufficient conditions
planar graphs
minimum weight
linear complementarity problem
weighted graph
approximate inference
convex optimization