Every toroidal graph without adjacent triangles is image-choosable

In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph without adjacent triangles is image-choosable. This result is best possible in the sense that image is a non-image-choosable toroidal graph. A linear time algorithm for producing such a coloring is presented also.