Sign in

A sufficient condition for planar graphs to be (3, 1)-choosable.

Min ChenYingying FanYiqiao WangWeifan Wang
Published in: J. Comb. Optim. (2017)
Keyphrases
  • sufficient conditions
  • planar graphs
  • minimum weight
  • exponential stability
  • lyapunov function
  • linear complementarity problem
  • lower bound
  • belief propagation
  • undirected graph