The following pages link to (Q3816026):
Displaying 9 items.
- Amortized efficiency of generating planar paths in convex position (Q638510) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- Monotone Gray codes and the middle levels problem (Q1805053) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- On a characterization of the standard Gray code by using the edge type on a hypercube (Q1847379) (← links)
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- The maximum length of circuit codes with long bit runs and a new characterization theorem (Q2329405) (← links)
- On distance Gray codes (Q5373994) (← links)