68 search results - page 1 / 14 » Computing Graph Roots Without Short Cycles |
STACS
2009
Springer
14 years 9 days ago
2009
Springer
JGT
2010
13 years 4 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...
CPC
2010
13 years 2 months ago
2010
APPROX
2008
Springer
13 years 7 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...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...