Login / Signup

On acyclic colorings of planar graphs.

Oleg V. Borodin
Published in: Discret. Math. (2006)
Keyphrases
  • planar graphs
  • np hard
  • graph coloring
  • minimum weight
  • np complete
  • approximate inference
  • social networks
  • random walk
  • approximation algorithms
  • combinatorial problems