M. Bona, The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns, Journal of Combinatorial Theory, Series A, vol.85, issue.1, pp.96-104, 1999.
DOI : 10.1006/jcta.1998.2908

N. G. De-bruijn, A combinatorial problem, Koninklijke Nederlandse Akademie v. Wetenschappen, vol.49, p.758764, 1946.

N. G. De-bruijn, Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once, pp.75-81, 1975.

P. Erd?-os and G. Szekeres, A combinatorial problem in geometry, Compositio Mathematica, vol.2, pp.463-470, 1935.

G. Hurlbert and G. Isaak, Equivalence class universal cycles for permutations, Discrete Math, pp.123-129, 1996.

B. Jackson, Universal cycles of k-subsets and k-permutations, Discrete Math, pp.114-150, 1993.

J. R. Johnson, Universal cycles for permutations, Discrete Math., in press, corrected proof, Universal cycles of classes of restricted words, 2008.