On k-diameter of k-connected graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(14)- On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- The \(k\)-diameter component edge connectivity parameter
- On generalized \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
- On the diameter of Kronecker graphs
- On radius and typical properties of \(n\)-vertex graphs of given diameter
- scientific article; zbMATH DE number 2185577 (Why is no real title available?)
- scientific article; zbMATH DE number 434495 (Why is no real title available?)
- Distance between two \(k\)-sets and path-systems extendibility.
- Conditional diameter saturated graphs
- On the minimum 2-wide diameter of cycles with chords
- ON THE SIZE OF LINKS IN Kn, n, Kn, n, 1, AND Kn
- Connectedness of digraphs and graphs under constraints on the conditional diameter
- On the connectivity of k-distance graphs
- Diameter and connectivity of finite simple graphs
This page was built for publication: On \(k\)-diameter of \(k\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952862)