Gray codes with restricted density

DOI10.1016/0012-365X(84)90179-1zbMath0572.05042MaRDI QIDQ1062075

Doug Wiedemann, Marshall W. Buck

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuitHamiltonian pathGray code

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99) Eulerian and Hamiltonian graphs (05C45)

Related Items (22)

On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains ⋮ Generating linear extensions of posets by transpositions ⋮ Efficient Computation of Middle Levels Gray Codes ⋮ Finding parity difference by involutions ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Star transposition Gray codes for multiset permutations ⋮ Trimming and gluing Gray codes ⋮ On the central levels problem ⋮ Efficient computation of statistical procedures based on all subsets of a specified size ⋮ Construction of 2-factors in the middle layer of the discrete cube ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ A short proof of the middle levels theorem ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ Rainbow Cycles in Flip Graphs ⋮ Proof of the middle levels conjecture ⋮ Solution of some multi-dimensional lattice path parity difference recurrence relations ⋮ Unnamed Item ⋮ A constant-time algorithm for middle levels Gray codes ⋮ Gray codes for reflection groups ⋮ Gray codes and symmetric chains ⋮ Rainbow Cycles in Flip Graphs.

Cites Work

• Unnamed Item
• Gray codes in graphs of subsets
• Hamiltonian cycles in the cartesian product of a tree and a cycle
• Some Simple Applications of the Travelling Salesman Problem
• Transposition Graphs

This page was built for publication: Gray codes with restricted density