Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable.

Published in: Discret. Math. (2020)

Keyphrases