The following pages link to On the snake in the box problem (Q1113920):
Displaying 11 items.
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← links)
- Hypercube sandwich approach to conferencing. (Q676254) (← links)
- A new lower bound for snake-in-the-box codes (Q1120544) (← links)
- Further results on snakes in powers of complete graphs (Q1182573) (← links)
- Covering the hypercube with a bounded number of disjoint snakes (Q1343173) (← links)
- On constructing snakes in powers of complete graphs (Q1381860) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Snakes, coils, and single-track circuit codes with spread \(k\) (Q2352350) (← links)
- (Q3457251) (← links)
- The Complexity of Snake (Q5282809) (← links)
- The maximum diameter of pure simplicial complexes and pseudo-manifolds (Q5892298) (← links)
