On the geodetic iteration number of distance-hereditary graphs

DOI10.1016/J.DISC.2015.09.025zbMATH Open1327.05089OpenAlexW1797176472MaRDI QIDQ898096FDOQ898096

Authors: Mitre C. Dourado, Rodolfo A. Oliveira, Dieter Rautenbach, 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

Recommendations

• On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
• scientific article; zbMATH DE number 1539554
• Two classes of graphs in which some problems related to convexity are efficiently solvable
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs

zbMATH Keywords

convex hullgeodetic iteration numberdistance-hereditary graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

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

Cited In (4)

• 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
• Title not available (Why is that?)
• On polygon numbers of circle graphs and distance hereditary graphs

This page was built for publication: On the geodetic iteration number of distance-hereditary graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898096)