On constructing snakes in powers of complete graphs
From MaRDI portal
Publication:1381860
DOI10.1016/S0012-365X(97)00039-3zbMath0894.05036MaRDI QIDQ1381860
Publication date: 7 September 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Cites Work
- 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
- Further results on snakes in powers of complete graphs
- The snake-in-the-box problem: A new upper bound
- Covering the hypercube with a bounded number of disjoint snakes
- Maximal length of circuit in a unitary \(n\)-dimensional cube
- Snakes in Powers of Complete Graphs
- Long Snakes in Powers of the Complete Graph with an Odd Number of Vertices
- A Method for Constructing Circuit Codes
- Unnamed Item
- Unnamed Item
This page was built for publication: On constructing snakes in powers of complete graphs
