A Sufficient Condition for a Toroidal Graph to be $3$-Choosable

Abstract

In this paper, it is proved that a toroidal graph without cycles of length $k$ for each $k\in \{4,5,7,10\}$ is $3$-choosable.