Choosability of toroidal graphs without short cycles

Authors


Abstract

Let G be a toroidal graph without cycles of a fixed length k, and χl(G) the list chromatic number of G. We establish tight upper bounds of χl(G) for the following values of k:

equation image

© 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.

Ancillary