Login / Signup

(1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6.

Yuehua BuCaixia Fu
Published in: Discret. Math. (2013)
Keyphrases
  • planar graphs
  • higher order
  • greedy algorithm