Login / Signup

Triangle-free planar graphs with at most 64n0.731 3-colorings.

Zdenek DvorákLuke Postle
Published in: J. Comb. Theory, Ser. B (2022)
Keyphrases
  • planar graphs
  • objective function
  • approximate inference
  • graph coloring
  • minimum weight
  • parameter estimation
  • weighted graph