1. Circuits and trees in oriented linear graphs;van Aardenne-Ehrenfest;Simon Stevin,1951
2. A combinatorial problem;de Bruijn;Proc. K. Ned. Akad. Wet.,1946
3. Z. Chang, M.F. Ezerman, P. Ke, Q. Wang, General criteria for successor rules to efficiently generate binary de Bruijn sequences, Online available at http://arxiv.org/abs/1911.06670.
4. Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography;Ding,1999
5. Constructing de Bruijn sequences with co-lexicographic order: The k-ary grandmama sequence;Dragon;European J. Combin.,2018