The following pages link to Petr Gregor (Q313800):
Displaying 6 items.
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Star transposition gray codes for multiset permutations (Q6490981) (← links)
- The Hamilton compression of highly symmetric graphs (Q6505928) (← links)
- Combinatorial generation via permutation languages. VI. Binary trees (Q6510569) (← links)
- Hamiltonian graphs are cup-stackable (Q6517054) (← links)
- Generating all invertible matrices by row operations (Q6533101) (← links)
