Publication:4318151
From MaRDI portal
zbMath0809.05065MaRDI QIDQ4318151
Publication date: 3 April 1995
Full work available at URL: https://eudml.org/doc/31858
Permutations, words, matrices (05A05) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45) Source coding (94A29)
Related Items
Cites Work
- Gray codes with restricted density
- Gray codes in graphs of subsets
- Stable and semi-stable unicyclic graphs
- Gray code sequences of partitions
- Binary tree gray codes
- Combinatorial Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- Generating Binary Trees Lexicographically
- Adjacent interchange generation of combinations
- Transposition Graphs
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Unnamed Item
- Unnamed Item