A Note on (3,1)-Choosable Toroidal Graphs

Baogang Xu, Qinglin Yu

An $(L,d{)}^{\ast }$-coloring is a mapping $\varphi$ that assigns a color $\varphi (v)\in L(v)$ to each vertex $v\in V(G)$ such that at most $d$ neighbors of $v$ receive colore $\varphi (v)$. A graph is calle…