Lengths of snakes in boxes

DOI10.1016/S0021-9800(67)80026-7MaRDI QIDQ5533021zbMATH OpenFDO

Authors Ludwig Danzer, Victor Klee

Publication date 1967

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0021-9800(67)80026-7

zbMATH Keywords

topology

Cited in

(12)

• A new upper bound for the length of snakes
• 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
• Further results on snakes in powers of complete graphs
• An upper bound on the size of the snake-in-the-box
• Isomorphism of maximum length circuit codes
• Maximal length of circuit in a unitary \(n\)-dimensional cube
• k-Pseudosnakes in n-dimensional Hypercubes
• Low order polynomial bounds on the expected performance of local improvement algorithms

This page was built for publication: Lengths of snakes in boxes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5533021)