Dense bipartite digraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- A line digraph of a complete bipartite digraph
- Large generalized cycles
- Superconnectivity of bipartite digraphs and graphs
- Disjoint paths of bounded length in large generalized cycles
- Connectivity of large bipartite digraphs and graphs
- Large (d,D, D',s)-bipartite digraphs
- Diameter vulnerability of iterated line digraphs
- Diameter-vulnerability of large bipartite digraphs
- Bus interconnection networks
- Bipartite graphs and digraphs with maximum connectivity
- On the acyclic disconnection and the girth
- Spanners of de Bruijn and Kautz graphs
- scientific article; zbMATH DE number 1735799 (Why is no real title available?)
- On Moore bipartite digraphs
- Unilaterally connected large digraphs and generalized cycles
- Dense Induced Subgraphs of Dense Bipartite Graphs
- On the weak distance-regularity of Moore-type digraphs
- On bipartite (1,1,k)-mixed graphs
- Multipartite Moore digraphs
This page was built for publication: Dense bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203051)