scientific article; zbMATH DE number 706769
From MaRDI portal
Publication:4318151
zbMATH Open0809.05065MaRDI QIDQ4318151FDOQ4318151
Authors: Martin Knor 
Publication date: 3 April 1995
Full work available at URL: https://eudml.org/doc/31858
Title of this publication is not available (Why is that?)
Recommendations
Permutations, words, matrices (05A05) Source coding (94A29) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Transposition Graphs
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Generation of Permutations by Adjacent Transposition
- Combinatorial Gray Codes
- Title not available (Why is that?)
- Efficient generation of the binary reflected gray code and its applications
- Gray codes with restricted density
- Gray code sequences of partitions
- Adjacent interchange generation of combinations
- Generating Binary Trees Lexicographically
- Title not available (Why is that?)
- Gray codes in graphs of subsets
- Binary tree gray codes
- Stable and semi-stable unicyclic graphs
Cited In (11)
- Gray codes, loopless algorithm and partitions
- Gray codes from antimatroids
- Kneser graphs are Hamiltonian
- Minimum gradation in greyscales of graphs
- Gray coding cubic planar maps
- Title not available (Why is that?)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Trimming and gluing Gray codes
- Gray code numbers for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
