A heuristic approach for constructing symmetric Gray codes

DOI10.1016/S0096-3003(03)00759-8zbMath1057.94036MaRDI QIDQ1883151

Günther F. Schrack, Xian Liu

Publication date: 1 October 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclesGray coordinate latticeHamiltonian paths on hypercubes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial codes (94B25)

Related Items (1)

Finding Lean Induced Cycles in Binary Hypercubes

Cites Work

• A survey of the theory of hypercube graphs
• Gray codes for partial match and range queries
• A Technique for Generating Specialized Gray Codes
• An upper bound associated with errors in Gray code (Corresp.)
• Efficient generation of the binary reflected gray code and its applications
• A Survey of Combinatorial Gray Codes
• The structure of single-track Gray codes
• Single-track Gray codes
• Some Complete Cycles on the n-Cube

This page was built for publication: A heuristic approach for constructing symmetric Gray codes