21 search results - page 1 / 5 » Directed Graphs Without Short Cycles |
CPC
2010
13 years 2 months ago
2010
JGT
2010
13 years 3 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...
STACS
2009
Springer
14 years 3 days ago
2009
Springer
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...
ARSCOM
2004
13 years 5 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...