$(1,k)$-coloring of graphs with girth at least $5$ on a surface

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

A graph is $(d_1,...,d_r)$-colorable if its vertex set can be partitioned into $r$ sets $V_1,...,V_r$ so that the maximum degree of the graph induced by $V_i$ is at most $d_i$…