An upper bound for the radius of a 3-connected graph
From MaRDI portal
Publication:1313873
DOI10.1016/0012-365X(93)90306-EzbMath0787.05055OpenAlexW1998333579MaRDI QIDQ1313873
Publication date: 19 May 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90306-e
Related Items (9)
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_4\)-free graph ⋮ An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Path eccentricity of graphs ⋮ On smallest 3-polytopes of given graph radius ⋮ The radius of \(k\)-connected planar graphs with bounded faces ⋮ Minimum size of a graph or digraph of given radius ⋮ Average distance and vertex-connectivity
Cites Work
This page was built for publication: An upper bound for the radius of a 3-connected graph
