Login / Signup

A sufficient condition for a planar graph to be 4-choosable.

Renyu XuJian-Liang Wu
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • sufficient conditions
  • planar graphs
  • linear complementarity problem
  • minimum weight
  • lyapunov function
  • belief propagation
  • exponential stability
  • weighted graph
  • approximate inference