1. H. S. Snevily (1994) The snake-in-the-box problem: A new upper bound, Dis crete Math. 133, No. 1-3, 307–314.
2. F. I. Solov’ëva (1987) An upper bound on the length of a cycle in the n-di-mensional unit cube (in Russian), Metody Diskret. Anal.
45, 71–76.
3. A. A. Evdokimov and S. A. Malyugin (1987) The “snake-in-the-box” code and paths in a lattice on a torus (in Russian), Mathematics Today, Vishcha Shkola, Kiev, pp. 108–116.
4. K. Deimer (1985) A new upper bound for the length of snakes, Combinatorica
5, No. 2, 109–120.
5. H. L. Abbot and M. Katchalski (1991) On the construction of a snake in the box codes, Utilitas Math. 40, 97–116.