scientific article; zbMATH DE number 5543113
From MaRDI portal
Publication:3620555
Recommendations
- scientific article; zbMATH DE number 1833074
- An upper bound on the radius of a 3-edge-connected graph
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- scientific article; zbMATH DE number 1136037
- Radius of (2k-1)-connected graphs
- The number of edges of radius-invariant graphs
- scientific article; zbMATH DE number 193589
- An upper bound for the radius of a 3-connected graph
- \(k\)-restricted edge-connectivity in triangle-free graphs
- An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph
Cited in
(13)- An upper bound for the radius of a 3-connected graph
- The radius of k-connected planar graphs with bounded faces
- Upper bounds on the diameter of bipartite and triangle-free graphs with prescribed edge connectivity
- Order and radius of 3-connected graphs
- On the radius of neighborhood graphs
- The number of edges in a bipartite graph of given radius
- An upper bound on the radius of a 3-edge-connected graph
- scientific article; zbMATH DE number 4185644 (Why is no real title available?)
- The k-radius of 2-connected graphs
- An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph
- An upper bound on the radius of a 3-vertex-connected C₄-free graph
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
- Minimum size of a graph or digraph of given radius
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 Q3620555)
