1. O. P. Godovykh, “A Study of Uniform Gray Codes,” in Proceedings of the 50th International Student Scientific Conference “Students and Progress in Science and Technology,” Novosibirsk, Russia, April 13–19, 2012 (Novosib. Gos. Univ., Novosibirsk, 2012), p.133.
2. A. A. Evdokimov, “On Enumeration of Subsets of a Finite Set,” in Methods of Discrete Analysis for Solving Combinatorial Problems, Vol. 34 (Inst. Mat., Novosibirsk, 1980), pp. 8–26.
3. L. A. Korolenko, “Finding Strongly Uniform Gray Codes,” in Proceedings of the 48th International Student Scientific Conference “Students and Progress in Science and Technology,” Novosibirsk, Russia, April 10–14, 2010 (Novosib. Gos. Univ., Novosibirsk, 2010), p.162.
4. F. Aguilóand A. Miralles, “On the Frobenius’ Problem of Three Numbers,” in Proceedings of 2005 European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2005, Berlin, Germany, September 5–9, 2005 (DMTCS, Nancy, 2005), p. 317–322.
5. Yu. Chebiryak and D. Kroening, “Towards a Classification of Hamiltonian Cycles in the 6-Cube,” J. Satisf. BooleanModel. Comput. 4 (1), 57–74 (2008).