On the spectrum of Hamiltonian cycles in the \(n\)-cube
From MaRDI portal
Publication:1984529
DOI10.1016/j.jctb.2021.08.002zbMath1473.05154OpenAlexW3196332366MaRDI QIDQ1984529
Publication date: 16 September 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2021.08.002
Graph theory (including graph drawing) in computer science (68R10) Other types of codes (94B60) Combinatorial codes (94B25) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Balanced Gray codes
- Binary Gray codes with long bit runs
- Classification of the Hamiltonian cycles in binary hypercubes
- A simple proof for the existence of exponentially balanced Gray codes
- On locally balanced gray codes
- Counting sequences
- A Survey of Combinatorial Gray Codes
- Construction of hamiltonian cycles with a given spectrum of edge directions in an n-dimensional Boolean cube
- On distance Gray codes
This page was built for publication: On the spectrum of Hamiltonian cycles in the \(n\)-cube