The following pages link to (Q3764182):
Displaying 9 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Optimal strategies in the average consensus problem (Q847130) (← links)
- A note on certain de Bruijn sequences with forbidden subsequences (Q965982) (← links)
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967) (← links)
- \(n\)-dimensional line digraphs (Q1336657) (← links)
- A method for constructing artificial DNA libraries based on generalized de Bruijn sequences (Q1735684) (← links)
- On a generalized model of labeled graphs (Q2446825) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
