Gray codes in graphs of subsets

DOI10.1016/0012-365X(80)90169-7MaRDI QIDQ1147162zbMATH OpenOpenAlexFDO

Authors J. T. Joichi, Dennis White

Publication date 1980

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(80)90169-7

zbMATH Keywords

graphs of subsetsGray codeshamiltonian cycles

Mathematics Subject Classification ID

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

Cites work

• Combinatorial Gray Codes
• Efficient generation of the binary reflected gray code and its applications
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Cited in

(5)

• Gray codes with restricted density
• Hamiltonian circuits and paths in subset graphs with circular adjacency
• Gray codes for reflection groups
• scientific article; zbMATH DE number 706769 (Why is no real title available?)
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions

This page was built for publication: Gray codes in graphs of subsets

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