Login / Signup
Planar graphs without intersecting 5-cycles are 4-choosable.
Daiqiang Hu
Jian-Liang Wu
Published in:
Discret. Math. (2017)
Keyphrases
</>
planar graphs
minimum weight
belief propagation
bipartite graph
dynamic programming
approximate inference
binary variables