Planar graphs with cycles of length neither 4 nor 6 are (2,0,0) ( 2 , 0 , 0 ) -colorable ?
We study improper colorability of planar graphs. We show that every planar graph with cycles of length neither 4 nor 6 is (2,0,0) ( 2 , 0 , 0 ) -colorable. This was done by reducibility analysis together with discharging.
planar graph cycle improper coloring combinatorial problems