6 search results - page 1 / 2 » k-Ordered Hamilton cycles in digraphs |
JCT
2008
13 years 11 months ago
2008
EJC
2006
13 years 11 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
SIAMDM
2008
13 years 10 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
DM
2006
13 years 11 months ago
2006
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
SIAMDM
2010
13 years 9 months ago
2010