On the geodetic iteration number of distance-hereditary graphs

DOI10.1016/j.disc.2015.09.025zbMath1327.05089OpenAlexW1797176472MaRDI QIDQ898096

Dieter Rautenbach, Mitre C. Dourado, Rodolfo A. Oliveira, Fábio Protti

Publication date: 8 December 2015

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

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

zbMATH Keywords

convex hulldistance-hereditary graphgeodetic iteration number

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent, On the Carathéodory and exchange numbers of geodetic convexity in graphs

Cites Work

• Unnamed Item
• The pre-hull number and lexicographic product
• On the computation of the hull number of a graph
• Distance-hereditary graphs
• Convex sets in graphs. II: Minimal path convexity
• Convexity in graphs
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• A characterization of ptolemaic graphs
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs