Gray codes with restricted density

DOI10.1016/0012-365X(84)90179-1MaRDI QIDQ1062075zbMATH OpenFDO

Authors Doug Wiedemann, Marshall W. Buck

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathGray codeHamiltonian circuit

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian circuits and paths in subset graphs with circular adjacency
• scientific article; zbMATH DE number 2192090
• Monotone Gray codes and the middle levels problem
• Generalized Gray codes with prescribed ends
• Transition restricted Gray codes

Cites work

• scientific article; zbMATH DE number 3752234 (Why is no real title available?)
• 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

Cited in

(28)

• Star transposition Gray codes for multiset permutations
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• Bipartite Kneser graphs are Hamiltonian
• Solution of some multi-dimensional lattice path parity difference recurrence relations
• Efficient Computation of Middle Levels Gray Codes
• On a combinatorial generation problem of Knuth
• Trimming and gluing Gray codes
• Dominated error correcting codes with distance two
• Proof of the middle levels conjecture
• Hamilton Paths in Graphs of Linear Extensions for Unions of Posets
• Construction of 2-factors in the middle layer of the discrete cube
• Kneser graphs are Hamiltonian
• On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains
• Gray codes for reflection groups
• Finding parity difference by involutions
• On the hardness of Gray code problems for combinatorial objects
• Generating linear extensions of posets by transpositions
• Gray codes and symmetric chains
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Binary Gray codes with long bit runs
• A short proof of the middle levels theorem
• A constant-time algorithm for middle levels Gray codes
• Rainbow cycles in flip graphs
• Rainbow cycles in flip graphs
• scientific article; zbMATH DE number 4087600 (Why is no real title available?)
• Bipartite Kneser graphs are Hamiltonian
• Efficient computation of statistical procedures based on all subsets of a specified size
• On the central levels problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062075)