Binary Gray codes with long bit runs

zbMath1023.05080MaRDI QIDQ1408531

Pavol Gvozdjak, Luis A. Goddyn

Publication date: 24 September 2003

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

Full work available at URL: https://eudml.org/doc/122966

zbMATH Keywords

gapHamming distancethresholdspreadHamilton cycleHamilton circle

Mathematics Subject Classification ID

Combinatorics on words (68R15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

On locally balanced gray codes ⋮ Description of polygonal regions by polynomials of bounded degree ⋮ Unnamed Item ⋮ On distance Gray codes ⋮ A construction of Gray codes inducing complete graphs ⋮ On the spectrum of Hamiltonian cycles in the \(n\)-cube ⋮ On flips in planar matchings ⋮ 2-Factors Without Close Edges in the n-Dimensional Cube ⋮ Gray codes and symmetric chains ⋮ The maximum length of circuit codes with long bit runs and a new characterization theorem

This page was built for publication: Binary Gray codes with long bit runs