Login / Signup

On acyclic 4-choosability of planar graphs without short cycles.

Min ChenAndré Raspaud
Published in: Discret. Math. (2010)
Keyphrases
  • planar graphs
  • np hard
  • np complete
  • higher order
  • approximate inference
  • undirected graph
  • minimum weight