scientific article; zbMATH DE number 706769
From MaRDI portal
Publication:4318151
Recommendations
Cites work
- scientific article; zbMATH DE number 4062616 (Why is no real title available?)
- scientific article; zbMATH DE number 3801574 (Why is no real title available?)
- Adjacent interchange generation of combinations
- Binary tree gray codes
- Combinatorial Gray Codes
- Efficient generation of the binary reflected gray code and its applications
- Generating Binary Trees Lexicographically
- Generation of Permutations by Adjacent Transposition
- Gray code sequences of partitions
- Gray codes in graphs of subsets
- Gray codes with restricted density
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Stable and semi-stable unicyclic graphs
- Transposition Graphs
Cited in
(12)- Gray codes, loopless algorithm and partitions
- Minimum gradation in greyscales of graphs
- Trimming and gluing Gray codes
- Method of modified depth-first search in a graph for constructing all possible Gray codes of a specified length
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Gray coding cubic planar maps
- Gray codes from antimatroids
- Kneser graphs are Hamiltonian
- scientific article; zbMATH DE number 5761830 (Why is no real title available?)
- scientific article; zbMATH DE number 5953464 (Why is no real title available?)
- Gray code numbers for graphs
- scientific article; zbMATH DE number 3974897 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318151)