On extremal factors of the de Bruijn graph

DOI10.1016/0095-8956(71)90009-8MaRDI QIDQ2553447zbMATH OpenOpenAlexFDO

Authors Abraham Lempel

Publication date 1971

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(71)90009-8

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Cited in

(8)

• The enumeration of shift register sequences
• An algorithm for generating necklaces of beads in two colors
• Covering the de Bruijn graph
• A new look at the de Bruijn graph
• Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
• Cycle decomposition by disjoint transpositions
• On extremal factors of de Bruijn-like graphs
• Possible values for the nonlinearity of de Bruijn feedback functions

This page was built for publication: On extremal factors of the de Bruijn graph

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