Login / Signup

Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable.

Lingji XuZhengke MiaoYingqian Wang
Published in: J. Comb. Optim. (2014)
Keyphrases
  • planar graphs
  • dynamic programming
  • minimum weight
  • training set
  • maximum likelihood