Gray codes in graphs of subsets

DOI10.1016/0012-365X(80)90169-7zbMath0449.05043OpenAlexW2045493194MaRDI QIDQ1147162

J. T. Joichi, Dennis E. 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

Gray codeshamiltonian cyclesgraphs of subsets

Mathematics Subject Classification ID

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

Related Items (5)

Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Unnamed Item ⋮ Gray codes for reflection groups ⋮ Gray codes with restricted density ⋮ Hamiltonian circuits and paths in subset graphs with circular adjacency

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

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