Connectivity of large bipartite digraphs and graphs
From MaRDI portal
Publication:1377820
DOI10.1016/S0012-365X(97)00313-0zbMath0886.05085MaRDI QIDQ1377820
Publication date: 8 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for maximally connected dense graphs
- Large fault-tolerant interconnection networks
- On the distance connectivity of graphs and digraphs
- On the linegraph of a directed-graph
- Connectivity of Regular Directed Graphs with Small Diameters
- Line Digraph Iterations and the (d, k) Digraph Problem
- Maximally connected digraphs
- The connectivity of large digraphs and graphs
- Dense bipartite digraphs