Pages that link to "Item:Q1313873"
From MaRDI portal
The following pages link to An upper bound for the radius of a 3-connected graph (Q1313873):
Displayed 9 items.
- An upper bound on the radius of a 3-edge-connected \(C_4\)-free graph (Q821263) (← links)
- An upper bound on the radius of a 3-vertex-connected \(C_4\)-free graph (Q827214) (← links)
- An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980) (← links)
- Minimum size of a graph or digraph of given radius (Q989544) (← links)
- The radius of \(k\)-connected planar graphs with bounded faces (Q1759405) (← links)
- Distances in graphs of girth 6 and generalised cages (Q2656962) (← links)
- On smallest 3-polytopes of given graph radius (Q2689496) (← links)
- Average distance and vertex-connectivity (Q3652548) (← links)
- Path eccentricity of graphs (Q6162021) (← links)