The following pages link to (Q4261811):
Displaying 5 items.
- Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube (Q1009043) (← links)
- Snakes and pseudo-snakes in powers of complete graphs (Q1096640) (← 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)