202 search results - page 3 / 41 » Cycle Cover with Short Cycles |
CPC
2008
14 years 11 months ago
2008
In 1998 Luczak, R
93
Voted
ARSCOM
2004
14 years 11 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...
COMBINATORICS
2004
14 years 11 months 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...
JGT
2010
14 years 10 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...
77
Voted
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
Knowledge is considered to be a key organizational resource in the 21st century and the knowledge management ‘movement’ has alerted organizations to the fact that they should ...