scientific article; zbMATH DE number 6837061
From MaRDI portal
Publication:3134400
Recommendations
- Lower and upper orientable strong diameters of graphs satisfying the Ore condition
- Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
- Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
- The diameter of strong orientations of strong products of graphs
- The diameter of strong orientations of Cartesian products of graphs
- Strong orientations of complete k-partite graphs achieving the strong diameter
- scientific article; zbMATH DE number 3991530
- Weak diameter and cyclic properties in oriented graphs
- Improved bound on the oriented diameter of graphs with given minimum degree
Cited in
(11)- scientific article; zbMATH DE number 1416462 (Why is no real title available?)
- On the strong distance problems of pyramid networks
- scientific article; zbMATH DE number 5115622 (Why is no real title available?)
- A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
- On strong distances in oriented graphs
- Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
- The diameter of strong orientations of strong products of graphs
- Lower and upper orientable strong diameters of graphs satisfying the Ore condition
- The strong distance problem on the Cartesian product of graphs
- Lower and upper orientable strong radius and diameter of Cartesian product of paths
- Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134400)
