Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Binary de Bruijn cycles under different equivalence relations

From MaRDI portal
Publication:1974523
Jump to:navigation, search

DOI10.1016/S0012-365X(99)00230-7zbMath0955.68091MaRDI QIDQ1974523

Stephen G. Hartke

Publication date: 27 July 2000

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


zbMATH Keywords

de Bruijn cycles


Mathematics Subject Classification ID

Combinatorics on words (68R15) Directed graphs (digraphs), tournaments (05C20)


Related Items (4)

Designing preference functions for de Bruijn sequences with forbidden words ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Particular cycles of a binary de Bruijn digraph ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density




This page was built for publication: Binary de Bruijn cycles under different equivalence relations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1974523&oldid=14428241"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki