论文信息 - Equivalence class universal cycles for permutations

Equivalence class universal cycles for permutations

We construct a universal cycle of n-permutations using n + 1 symbols and an equivalence relation based on differences. Moreover a complete family of universal cycles of this kind is constructed.

Glenn H. Hurlbert | Garth Isaak | G. Hurlbert | G. Isaak

[1] Bradley W. Jackson. Universal cycles of k-subsets and k-permutations , 1993, Discret. Math..

[2] W. T. Tutte. Graph Theory , 1984 .

[3] Fan Chung Graham,et al. Universal cycles for combinatorial structures , 1992, Discret. Math..