Gray codes with restricted density

DOI10.1016/0012-365X(84)90179-1zbMATH Open0572.05042MaRDI QIDQ1062075FDOQ1062075

Authors: Doug Wiedemann, Marshall W. Buck 

Publication date: 1984

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

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

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)

Cites Work

• Some Simple Applications of the Travelling Salesman Problem
• Transposition Graphs
• Title not available (Why is that?)
• Hamiltonian cycles in the cartesian product of a tree and a cycle
• Gray codes in graphs of subsets

Cited In (28)

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

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)