Login / Signup

A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable.

Enqiang ZhuJin Xu
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • sufficient conditions
  • planar graphs
  • exponential stability
  • lyapunov function
  • image segmentation
  • probabilistic model
  • linear program
  • linear complementarity problem
  • linear programming
  • approximate inference