A new lower bound for snake-in-the-box codes

DOI10.1007/BF02122688zbMath0672.94010MaRDI QIDQ1120544

Jerzy Wojciechowski

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

lower boundsnake-in-the-box codes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial codes (94B25)

Related Items (9)

Isomorphism of maximum length circuit codes ⋮ The snake-in-the-box problem: A new upper bound ⋮ Covering the hypercube with a bounded number of disjoint snakes ⋮ On constructing snakes in powers of complete graphs ⋮ On the maximum length of coil-in-the-box codes in dimension 8 ⋮ Further results on snakes in powers of complete graphs ⋮ Hypercube sandwich approach to conferencing. ⋮ Unnamed Item ⋮ 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
• On the snake in the box problem
• Snake in the Box Codes
• Longest ``Separated Paths and Loops in an N Cube
• Generalized Snake-in-the-Box Codes
• Lengths of snakes in boxes

This page was built for publication: A new lower bound for snake-in-the-box codes