The following pages link to Gray codes in graphs of subsets (Q1147162):
Displaying 4 items.
- Gray codes with restricted density (Q1062075) (← links)
- Hamiltonian circuits and paths in subset graphs with circular adjacency (Q1313856) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
