An upper bound on the size of the snake-in-the-box
From MaRDI portal
Publication:1382411
DOI10.1007/BF01200911zbMath0886.05084OpenAlexW222492914MaRDI QIDQ1382411
Publication date: 26 March 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200911
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (5)
Isomorphism of maximum length circuit codes ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)
Cites Work
This page was built for publication: An upper bound on the size of the snake-in-the-box