Login / Signup

A note on the acyclic 3-choosability of some planar graphs.

Hervé HocquardMickaël MontassierAndré Raspaud
Published in: Discret. Appl. Math. (2010)
Keyphrases
  • planar graphs
  • np hard
  • minimum weight
  • linear programming
  • np complete
  • approximate inference
  • special case
  • probabilistic model
  • upper bound
  • least squares
  • upper and lower bounds