On extremal factors of the de Bruijn graph

DOI10.1016/0095-8956(71)90009-8zbMath0239.05121OpenAlexW1997566898MaRDI QIDQ2553447

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

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

Related Items (6)

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 ⋮ The enumeration of shift register sequences

Cites Work

• Unnamed Item

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