Sciweavers

EJC
2006
13 years 5 months ago
Hamiltonicity of digraphs for universal cycles of permutations
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...
Garth Isaak