A Gray Code for Necklaces of Fixed Density

DOI10.1137/S089548019528143XzbMath0866.05036OpenAlexW2093873753MaRDI QIDQ4717574

Terry Min Yih Wang, Carla D. Savage

Publication date: 8 July 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548019528143x

zbMATH Keywords

Hamiltonian cyclesHamilton pathGray codenecklacescombinatorial generation

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Finding the largest fixed-density necklace and Lyndon word ⋮ Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ Cyclic compositions and cycles of the hypercube ⋮ Necklaces and Lyndon words in colexicographic and binary reflected Gray code order ⋮ A Gray code for fixed-density necklaces and Lyndon words in constant amortized time ⋮ A fast algorithm to generate necklaces with fixed content ⋮ 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: A Gray Code for Necklaces of Fixed Density