Covering the de Bruijn graph

DOI10.1016/0012-365X(91)90362-6zbMath0764.05071MaRDI QIDQ1176741

Roy D. Bryant, Harold Fredricksen

Publication date: 25 June 1992

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

zbMATH Keywords

boundsde Bruijn graphcoverindependent vertices

Mathematics Subject Classification ID

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

Related Items (2)

Independence number of de Bruijn graphs ⋮ Independence number of iterated line digraphs

Cites Work

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

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