8 search results - page 1 / 2 » Choosability of toroidal graphs without short cycles |
JGT
2010
13 years 5 months ago
2010
: 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...
DAM
2007
13 years 6 months ago
2007
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...
CPC
2010
13 years 4 months ago
2010
STACS
2009
Springer
14 years 1 months ago
2009
Springer
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
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...