Lengths of snakes in boxes
From MaRDI portal
Publication:5533021
DOI10.1016/S0021-9800(67)80026-7zbMath0153.54202MaRDI QIDQ5533021
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items (12)
Isomorphism of maximum length circuit codes ⋮ Snakes and pseudo-snakes in powers of complete graphs ⋮ On the snake in the box problem ⋮ A new lower bound for snake-in-the-box codes ⋮ The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions ⋮ Local optimization on graphs ⋮ An upper bound on the size of the snake-in-the-box ⋮ Further results on snakes in powers of complete graphs ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ Maximal length of circuit in a unitary \(n\)-dimensional cube ⋮ A new upper bound for the length of snakes ⋮ k-Pseudosnakes in n-dimensional Hypercubes
This page was built for publication: Lengths of snakes in boxes
