322 search results - page 10 / 65 » On Infinite Cycles I |
ENDM
2008
14 years 9 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
EJC
2007
14 years 9 months ago
2007
A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩ Aj = ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a ...
DM
2008
14 years 9 months ago
2008
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
COR
2004
14 years 9 months ago
2004
We collected and analyzed a number of linear programming problems that have been shown to cycle (not converge) when solved by Dantzig's original simplex algorithm. For these ...
TC
2002
14 years 9 months ago
2002
We investigate the timing properties of the timed token protocol that are necessary to guarantee synchronous message deadlines. A tighter upper bound on the elapse time between the...