Sign in

Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable.

Yiqiao WangXiaoxue HuWei-Fan Wang
Published in: SIAM J. Discret. Math. (2014)
Keyphrases
  • planar graphs
  • knapsack problem
  • approximate inference
  • minimum weight