The contour of a bridged graph is geodetic

DOI10.1016/j.dam.2015.10.007zbMath1333.05098OpenAlexW2162776332MaRDI QIDQ266844

Mauro Mezzini, Marina Moscarini

Publication date: 7 April 2016

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.007

zbMATH Keywords

contourgeodesic convexitybridged graphgeodetic set

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

On the geodetic iteration number of the contour of a graph ⋮ On the contour of bipartite graphs ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

Cites Work

• On the geodeticity of the contour of a graph
• Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
• On local convexity in graphs
• On bridged graphs and cop-win graphs
• Bridged graphs are cop-win graphs: An algorithmic proof
• On the contour of graphs
• Geodeticity of the contour of chordal graphs
• Rebuilding convex sets in graphs
• Convexity in Graphs and Hypergraphs

This page was built for publication: The contour of a bridged graph is geodetic