Transition restricted Gray codes

MaRDI QIDQ1918866zbMATH OpenFDO

Authors Bette Bultena, Frank Ruskey

Publication date 21 July 1996

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/228290, http://www.emis.de/journals/EJC/Volume_3/volume3.html#R11

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

treedistanceHamiltonian cycleHamiltonian pathdiameterGray code\(n\)-cubetransition sequence\(G\)-code

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Combinatorial codes (94B25)

Recommendations

• Graphs induced by Gray codes
• Linear time construction of a compressed Gray code
• Some classes of bipartite graphs induced by Gray codes
• A construction of Gray codes inducing complete graphs
• scientific article; zbMATH DE number 5761830

Cited in

(16)

• Linear time construction of a compressed Gray code
• Graphs induced by Gray codes
• On the possibility of an Euler tour representation by Gray codes
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• Gray codes with bounded weights
• Some classes of bipartite graphs induced by Gray codes
• scientific article; zbMATH DE number 17941 (Why is no real title available?)
• Hamiltonian surfaces in the 4-cube, 4-bit Gray codes and Venn diagrams
• Antipodal Gray codes
• On the \((n,t)\)-antipodal Gray codes
• Gray codes with restricted density
• A note on Beckett-Gray codes and the relationship of Gray codes to data structures
• Matchings in hypercubes extend to long cycles
• Gray codes and symmetric chains
• Gray codes and symmetric chains
• A construction of Gray codes inducing complete graphs

This page was built for publication: Transition restricted Gray codes

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