Login / Signup

Complexity dichotomy for oriented homomorphism of planar graphs with large girth.

Guillaume GuéganPascal Ochem
Published in: Theor. Comput. Sci. (2015)
Keyphrases
  • planar graphs
  • computational complexity
  • model selection