Recommendations
Cites work
- Diameters in graphs
- scientific article; zbMATH DE number 4144019 (Why is no real title available?)
- scientific article; zbMATH DE number 3460309 (Why is no real title available?)
- scientific article; zbMATH DE number 3255492 (Why is no real title available?)
- scientific article; zbMATH DE number 3334009 (Why is no real title available?)
- Maximum diameter of regular digraphs
- The diameter of almost Eulerian digraphs
- The diameter of directed graphs
- The number of edges in a bipartite graph of given radius
Cited in
(13)- On the girth of digraphs
- On average distance in tournaments and Eulerian digraphs
- Size of graphs and digraphs with given diameter and connectivity constraints
- The eccentricity matrix of a digraph
- The largest graphs with given order and diameter: a simple proof
- Maximum size of digraphs with some parameters
- Minimum orders of Eulerian oriented digraphs with given diameter
- Maximum size of digraphs of given radius
- The diameter of almost Eulerian digraphs
- Bounds on the fault-diameter of graphs
- Turán number of strong digraphs forbidden at least two triangles
- A diameter bound for 4-edge-connected C₄-free graphs
- Diameter and maximum degree in Eulerian digraphs
This page was built for publication: Distance and size in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468452)
