Login / Signup

Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable.

Lifeng DaiYingqian WangJinghan Xu
Published in: Discret. Math. (2017)
Keyphrases
  • planar graphs
  • minimum weight
  • linear programming