The snake-in-the-box problem: A new upper bound
From MaRDI portal
Publication:1336714
DOI10.1016/0012-365X(94)90039-6zbMath0812.05033MaRDI QIDQ1336714
Publication date: 3 November 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Isomorphism of maximum length circuit codes ⋮ On constructing snakes in powers of complete graphs ⋮ An upper bound on the size of the snake-in-the-box ⋮ Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)
Cites Work
This page was built for publication: The snake-in-the-box problem: A new upper bound