: 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 Contract grant sponsor: RGC; Contract grant...
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 w...
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...