Login / Signup

Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable.

Chuanni ZhangYingqian WangMin Chen
Published in: Discret. Math. (2016)
Keyphrases
  • planar graphs
  • minimum weight
  • closed form
  • approximate inference
  • partition function