1. Abbot H.L., Katchalski M.: On the construction of snake in the box codes. Util. Math. 40, 97–116 (1991).
2. Byrnes K.M.: A new method for constructing circuit codes. Bull. ICA 80, 40–60 (2017).
3. Casella D.A., Potter W.D.: New lower bounds for the snake-in-the-box problem: Using evolutionary techniques to hunt for snakes. In: Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, pp. 264–269 (2005).
4. Chebiryak Y., Kroening D.: An efficient SAT encoding of circuit codes. In: International Symposium on Information Theory and Its Applications (2008).
5. Deimer K.: Some new bounds on the maximum length of circuit codes. IEEE Trans. Inf. Theory 30, 754–756 (1984).