The following pages link to The square root of a digraph (Q5554172):
Displayed 5 items.
- Computing roots of graphs is hard (Q1336641) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Characterization of n-path graphs and of graphs having \(n\)-th root (Q2562796) (← links)
- Square roots in finite full transformation semigroups (Q3946354) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)