Choosability of toroidal graphs without short cycles

Let G be a toroidal graph without cycles of a fixed length k, and [chi]l(G) the list chromatic number of G. We establish tight upper bounds of [chi]l(G) for the following values of k: © 2009 Wiley Periodicals, Inc. J Graph Theory

Published by

Original source : http://dx.doi.org/10.1002%2Fjgt.20460...