Gray codes for necklaces

From MaRDI portal

Revision as of 01:16, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1567676

Jump to:navigation, search

DOI10.1016/S0012-365X(99)00348-9zbMath0946.05003OpenAlexW2008791167MaRDI QIDQ1567676

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

Hamilton cycle Gray codes necklace

Mathematics Subject Classification ID

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

Related Items (4)

A Gray code for fixed-density necklaces and Lyndon words in constant amortized time ⋮ Binary bubble languages and cool-lex order ⋮ More restrictive Gray codes for necklaces and Lyndon words ⋮ Ranking and unranking fixed-density necklaces and Lyndon words

This page was built for publication: Gray codes for necklaces

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1567676&oldid=13849598"