The following pages link to Covering the de Bruijn graph (Q1176741):
Displaying 5 items.
- Independently prescribable sets of n-letter words (Q1077431) (← links)
- Independence number of iterated line digraphs (Q1779497) (← links)
- Independence number of de Bruijn graphs (Q2497496) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- Recoloring the colored de Bruijn graph (Q6109729) (← links)