The snake-in-the-box problem: A new upper bound

DOI10.1016/0012-365X(94)90039-6zbMath0812.05033MaRDI QIDQ1336714

Hunter S. Snevily

Publication date: 3 November 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypercubeupper boundlongest cyclesnake-in-the-box problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

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

• Unnamed Item
• Unnamed Item
• A new upper bound for the length of snakes
• A new lower bound for snake-in-the-box codes
• Further results on snakes in powers of complete graphs

This page was built for publication: The snake-in-the-box problem: A new upper bound