Gray codes for necklaces

DOI10.1016/S0012-365X(99)00348-9MaRDI QIDQ1567676zbMATH OpenOpenAlexFDO

Authors Takao Ueda

Publication date 3 August 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00348-9

zbMATH Keywords

necklaceHamilton cycleGray codes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Eulerian and Hamiltonian graphs (05C45) Combinatorics on words (68R15)

Recommendations

• A Gray Code for Necklaces of Fixed Density
• Gray codes for necklaces and Lyndon words of arbitrary base
• Gray-ordered binary necklaces
• More restrictive Gray codes for necklaces and Lyndon words
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time

Cited in

(9)

• Necklaces and slimes
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• More restrictive Gray codes for necklaces and Lyndon words
• Gray codes for necklaces and Lyndon words of arbitrary base
• Ranking and unranking fixed-density necklaces and Lyndon words
• Difference necklaces
• Gray-ordered binary necklaces
• Equivalence classes of 5-bit Gray codes
• Binary bubble languages and cool-lex order

This page was built for publication: Gray codes for necklaces

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