Login / Signup

Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable.

Runrun LiuXiangwen LiGexin Yu
Published in: Discret. Math. (2016)
Keyphrases
  • planar graphs
  • minimum weight
  • belief propagation
  • bipartite graph