8 search results - page 1 / 2 » Choosability of toroidal graphs without short cycles |
76
Voted
JGT
2010
14 years 9 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...
95
Voted
DAM
2007
14 years 11 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...
84
Voted
CPC
2010
14 years 8 months ago
2010
78
Voted
STACS
2009
Springer
15 years 5 months ago
2009
Springer
103
Voted
APPROX
2008
Springer
15 years 28 days 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...