618 search results - page 2 / 124 » Short cycle connectivity |
59
Voted
IJBC
2008
15 years 21 days ago
2008
103
Voted
ARSCOM
2004
15 years 16 days 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...
121
click to vote
APPROX
2008
Springer
15 years 2 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...
107
Voted
COMBINATORICS
2004
15 years 16 days ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
92
Voted
JGT
2010
14 years 11 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...