Covering the de Bruijn graph

DOI10.1016/0012-365X(91)90362-6MaRDI QIDQ1176741zbMATH OpenFDO

Authors Roy D. Bryant, Harold Fredricksen

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(91)90362-6

zbMATH Keywords

boundscoverde Bruijn graphindependent vertices

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 2050882
• scientific article; zbMATH DE number 975337
• scientific article; zbMATH DE number 4216772
• The maximum independent sets of de Bruijn graphs of diameter 3
• Independence number of de Bruijn graphs

Cites work

• A proof of Golomb's conjecture for the de Bruijn graph
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• On extremal factors of the de Bruijn graph

Cited in

(9)

• Independently prescribable sets of n-letter words
• Independence number of iterated line digraphs
• Independence number of de Bruijn graphs
• On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
• scientific article; zbMATH DE number 2050882 (Why is no real title available?)
• scientific article; zbMATH DE number 1874376 (Why is no real title available?)
• scientific article; zbMATH DE number 975337 (Why is no real title available?)
• Recoloring the colored de Bruijn graph
• The maximum independent sets of de Bruijn graphs of diameter 3

This page was built for publication: Covering the de Bruijn graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176741)