Independently prescribable sets of n-letter words

DOI10.1016/0012-365X(84)90048-7zbMath0595.05047MaRDI QIDQ1077431

Judith E. Dayhoff

Publication date: 1984

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

zbMATH Keywords

de Bruijn sequencesn-letter wordssets of edges of Hamiltonian graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Normal Recurring Decimals
• Unnamed Item