Login / Signup

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable.

Yuxue YinGexin Yu
Published in: Discret. Math. (2019)
Keyphrases
  • planar graphs
  • dynamic programming
  • approximate inference
  • least squares
  • directed graph
  • minimum weight