Login / Signup

1-planar graphs are odd 13-colorable.

Runrun LiuWeifan WangGexin Yu
Published in: Discret. Math. (2023)
Keyphrases
  • planar graphs
  • minimum weight
  • approximate inference
  • graphical models
  • linear programming
  • belief propagation
  • undirected graph
  • binary variables
  • partition function