On the snake in the box problem

DOI10.1016/0095-8956(88)90051-2zbMath0662.05034OpenAlexW2064273693MaRDI QIDQ1113920

H. L. Abbott, Meir Katchalski

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90051-2

zbMATH Keywords

graphcubelongest cycle

Mathematics Subject Classification ID

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

Related Items (9)

Covering the hypercube with a bounded number of disjoint snakes ⋮ A new lower bound for snake-in-the-box codes ⋮ On constructing snakes in powers of complete graphs ⋮ The maximum diameter of pure simplicial complexes and pseudo-manifolds ⋮ Further results on snakes in powers of complete graphs ⋮ Hypercube sandwich approach to conferencing. ⋮ On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric ⋮ Separator-based graph embedding into multidimensional grids with small edge-congestion ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)

Cites Work

• A new upper bound for the length of snakes
• A Method for Constructing Circuit Codes
• Lengths of snakes in boxes
• Upper bounds on the length of circuits of even spread in the d-cube
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the snake in the box problem