Note on improper coloring of -planar graphs
Yanan Chu, Lei Sun, Jun Yue (2019)
Czechoslovak Mathematical Journal
Similarity:
A graph is called improperly -colorable if the vertex set can be partitioned into subsets such that the graph induced by the vertices of has maximum degree at most for all . In this paper, we mainly study the improper coloring of -planar graphs and show that -planar graphs with girth at least are -colorable.