On the geodetic iteration number of the contour of a graph

DOI10.1016/j.dam.2016.02.012zbMath1335.05049OpenAlexW2296996162MaRDI QIDQ277655

Mauro Mezzini

Publication date: 2 May 2016

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

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

zbMATH Keywords

geodesic convexitycontour of a graphgeodetic iteration number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99)

Related Items (3)

Bounds and algorithms for geodetic hulls ⋮ On the Carathéodory and exchange numbers of geodetic convexity in graphs ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs

Cites Work

• The contour of a bridged graph is geodetic
• 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
• Bridged graphs and geodesic convexity
• On the contour of graphs
• Geodeticity of the contour of chordal graphs
• Rebuilding convex sets in graphs
• On the geodetic number of a graph
• Convexity in Graphs and Hypergraphs

This page was built for publication: On the geodetic iteration number of the contour of a graph