212 search results - page 37 / 43 » On Lengths of Rainbow Cycles |
ISPAN
1997
IEEE
14 years 1 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
SIROCCO
1997
13 years 11 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
DM
2008
13 years 9 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
BC
2000
13 years 9 months ago
2000
The gait transition in legged animals has attracted many researchers, and its relation to metabolic cost and mechanical work has been discussed in recent decades. We assumed that t...
ARSCOM
1998
13 years 9 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...