Combinatorial Gray codes -- an updated survey
From MaRDI portal
Publication:6115244
DOI10.37236/11023arXiv2202.01280MaRDI QIDQ6115244
Publication date: 16 August 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.01280
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Enumerative combinatorics (05A99) Combinatorial codes (94B25)
Related Items (4)
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Generating cyclic rotation Gray codes for stamp foldings and semi-meanders ⋮ Hamiltonian intervals in the lattice of binary paths
This page was built for publication: Combinatorial Gray codes -- an updated survey