The radius of \(k\)-connected planar graphs with bounded faces

DOI10.1016/j.disc.2012.08.019zbMath1293.05074OpenAlexW2069425064MaRDI QIDQ1759405

Simon Mukwembi, Peter Dankelmann, Patrick Ali

Publication date: 20 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.019

zbMATH Keywords

distanceradiusplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items

Proximity in triangulations and quadrangulations ⋮ Distances in graphs of girth 6 and generalised cages ⋮ Unnamed Item ⋮ Steiner diameter of 3, 4 and 5-connected maximal planar graphs ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations

Cites Work

• The number of edges in a bipartite graph of given radius
• On the radius of graphs
• Radius, diameter, and minimum degree
• An upper bound for the radius of a 3-connected graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item