212 search results - page 13 / 43 » On Lengths of Rainbow Cycles |
JCO
2010
13 years 8 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...
JGT
2010
13 years 8 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...
CCGRID
2003
IEEE
14 years 2 months ago
2003
IEEE
Abstract— Cycle-harvesting software on commodity computers is available from a number of companies and a significant part of the Grid computing landscape. However, creating comm...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
DM
2002
13 years 9 months ago
2002
Abstract. A k-sized balanced sampling plan excluding contiguous units of order v and index , denoted by BSEC(v, k, ), is said to be bicyclic if it admits an automorphism consisting...