Login / Signup

On the complexity of H-colouring planar graphs.

Gary MacGillivrayMark H. Siggers
Published in: Discret. Math. (2009)
Keyphrases
  • planar graphs
  • worst case
  • computational complexity
  • bayesian networks
  • dynamic programming