Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
DOI10.1016/J.DISC.2006.04.037zbMATH Open1113.05030OpenAlexW2131690757MaRDI QIDQ861797FDOQ861797
Authors: Ortrud R. Oellermann, M. L. Puertas 
Publication date: 2 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.04.037
Recommendations
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- On the Steiner, geodetic and hull numbers of graphs
- Geodetic sets and Steiner sets in graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
Trees (05C05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rebuilding convex sets in graphs
- Convexity in Graphs and Hypergraphs
- Steiner centers in graphs
- Distance-hereditary graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Steiner intervals in graphs
- The Steiner number of a graph
- Completely separable graphs
- Steiner Distance-Hereditary Graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Locally geodesic cycles in 2-self-centered graphs
- Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
- Computational Complexity of Geodetic Set
Cited In (18)
- Geodetic sets and Steiner sets in graphs
- Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
- A note on 3-Steiner intervals and betweenness
- Steiner convex sets and Cartesian product
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Separation properties of 3-Steiner and 3-monophonic convexity in graphs
- Steiner intervals, geodesic intervals, and betweenness
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- Strong geodetic problem in grid-like architectures
- Convex sets in lexicographic products of graphs
- On 3-Steiner simplicial orderings
- On the geodetic iteration number of distance-hereditary graphs
- Rebuilding convex sets in graphs
- Some Steiner concepts on lexicographic products of graphs
- On a local 3-Steiner convexity
- Title not available (Why is that?)
- Local Steiner convexity
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
This page was built for publication: Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861797)
