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

Published in: Discret. Math. (2017)

Keyphrases