Login / Signup

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.

Dingzhu DuLan ShenYingqian Wang
Published in: Discret. Appl. Math. (2009)
Keyphrases
  • planar graphs
  • random walk
  • approximate inference
  • undirected graph
  • minimum weight