Login / Signup

The number of colorings of planar graphs with no separating triangles.

Carsten Thomassen
Published in: J. Comb. Theory, Ser. B (2017)
Keyphrases
  • computational complexity
  • planar graphs
  • pairwise
  • higher order
  • maximum likelihood