On universal partial words

DOI10.1016/j.endm.2017.06.043zbMath1378.05112OpenAlexW2560612881MaRDI QIDQ1689916

Brian Y. Sun, Sergey Kitaev, Torsten Mütze, Herman Z. Q. Chen

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.043

zbMATH Keywords

Hamiltonian cyclede Bruijn graphEulerian cyclepartial worduniversal word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Scattered Factor-Universality of Words ⋮ Computing generalized de Bruijn sequences ⋮ Absent Subsequences in Words

Cites Work

• Unnamed Item
• Unnamed Item
• The coolest way to generate binary strings
• On the complexity of deciding avoidability of sets of partial words
• Pattern avoidance in partial permutations
• Unavoidable sets of partial words
• Square-free partial words
• Overlap-freeness in infinite partial words
• Universal cycles for combinatorial structures
• Partial words and a theorem of Fine and Wilf
• Shorthand universal cycles for permutations
• Primitive partial words
• m-ary closed sequences
• Binary Ring Sequences

This page was built for publication: On universal partial words