212 search results - page 16 / 43 » On Lengths of Rainbow Cycles |
105
click to vote
JCT
2010
14 years 10 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
JCB
2006
14 years 11 months ago
2006
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
JGT
2006
14 years 11 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
DM
2008
14 years 12 months ago
2008
We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
76
Voted
AMC
2007
14 years 11 months ago
2007
The balanced hypercube BHn is a variant of the hypercube Qn. Huang and Wu proved that BHn has better properties than Qn with the same number of links and processors. In particular...