On the geodetic iteration number of distance-hereditary graphs
From MaRDI portal
Publication:898096
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
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- A characterization of ptolemaic graphs
- Convex sets in graphs. II: Minimal path convexity
- Convexity in graphs
- Distance-hereditary graphs
- On the computation of the hull number of a graph
- 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
- The pre-hull number and lexicographic product
Cited in
(4)- On polygon numbers of circle graphs and distance hereditary graphs
- 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
- scientific article; zbMATH DE number 1539554 (Why is no real title available?)
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)