A new upper bound for the length of snakes

DOI10.1007/BF02579373zbMath0569.94016MaRDI QIDQ1061716

Knut Deimer

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

maximum lengthcircuit codegraph of the d-dimensional unit cube

Mathematics Subject Classification ID

Paths and cycles (05C38) Other types of codes (94B60)

Related Items (6)

The snake-in-the-box problem: A new upper bound ⋮ On the snake in the box problem ⋮ A new lower bound for snake-in-the-box codes ⋮ An upper bound on the size of the snake-in-the-box ⋮ Further results on snakes in powers of complete graphs ⋮ Snakes, coils, and single-track circuit codes with spread \(k\)

Cites Work

• Unnamed Item
• Generalized Snake-in-the-Box Codes
• Lengths of snakes in boxes
• Upper bounds on the length of circuits of even spread in the d-cube

This page was built for publication: A new upper bound for the length of snakes