Further results on snakes in powers of complete graphs

DOI10.1016/0012-365X(91)90103-9zbMath0758.05062MaRDI QIDQ1182573

H. L. Abbott, Meir Katchalski

Publication date: 28 June 1992

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

zbMATH Keywords

complete graphsnake

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

The snake-in-the-box problem: A new upper bound ⋮ On constructing snakes in powers of complete graphs

Cites Work

• Unnamed Item
• 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
• Snakes in Powers of Complete Graphs
• A Method for Constructing Circuit Codes
• Lengths of snakes in boxes

This page was built for publication: Further results on snakes in powers of complete graphs