On basis diagraphs
From MaRDI portal
Cited in
(9)- On strong digraphs with a unique minimally strong subdigraph
- Bounds of the longest directed cycle length for minimal strong digraphs
- Spanning subgraphs of k-connected digraphs
- A unified treatment of nearly reducible and nearly decomposable matrices
- Structural properties of minimal strong digraphs versus trees
- Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
- Minimal strong digraphs
- The number of cut vertices and cut arcs in a strong directed graph
- Graph theory
This page was built for publication: On basis diagraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5529200)