(1,0,0)-colorability of planar graphs without cycles of length 4 or 6

Ligang Jin, Yingli Kang, Peipei Liu +1

A graph $G$ is $(d_1,d_2,d_3)$-colorable if the vertex set $V(G)$ can be partitioned into three subsets $V_1,V_2$ and $V_3$ such that for $i\in \{1,2,3\}$, the induced graph $G[V_i]…