On the largest strong components in \(m\)-out digraphs
From MaRDI portal
Publication:1182737
DOI10.1016/0012-365X(91)90305-LzbMath0751.05080MaRDI QIDQ1182737
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On depth first search trees in \(m\)-out digraphs
- On the connectivity of random m-orientable graphs and digraphs
- Finding Hamilton cycles in sparse random graphs
- Parallel concepts in graph theory
- On the existence of Hamiltonian cycles in a class of random graphs
- Depth-First Search and Linear Graph Algorithms