scientific article; zbMATH DE number 706769

zbMath0809.05065MaRDI QIDQ4318151

Martin Knor

Publication date: 3 April 1995

Full work available at URL: https://eudml.org/doc/31858

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

permutationsHamiltonian cycleHamiltonian pathslabellingsGray codes

Mathematics Subject Classification ID

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 (1)

Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality

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

This page was built for publication: