Login / Signup

Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable.

Ying BaiXiangwen LiGexin Yu
Published in: J. Comb. Optim. (2017)
Keyphrases
  • social networks