Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
From MaRDI portal
Publication:861797
DOI10.1016/j.disc.2006.04.037zbMath1113.05030MaRDI QIDQ861797
Ortrud R. Oellermann, María Luz 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
05C05: Trees
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
05C38: Paths and cycles
05C12: Distance in graphs
Related Items
A note on 3-Steiner intervals and betweenness, Helly theorems for 3-Steiner and 3-monophonic convexity in graphs, On a local 3-Steiner convexity, Convex sets in lexicographic products of graphs, Separation properties of 3-Steiner and 3-monophonic convexity in graphs, Strong geodetic problem in grid-like architectures, Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs, Local Steiner convexity, Steiner intervals, geodesic intervals, and betweenness, On 3-Steiner simplicial orderings, Steiner convex sets and Cartesian product, Algorithmic aspects of Steiner convexity and enumeration of Steiner trees, Rebuilding convex sets in graphs, Some Steiner concepts on lexicographic products of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Completely separable graphs
- Locally geodesic cycles in 2-self-centered graphs
- Distance-hereditary graphs
- Steiner intervals in graphs
- Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Rebuilding convex sets in graphs
- Convexity in Graphs and Hypergraphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Steiner Distance-Hereditary Graphs
- Computational Complexity of Geodetic Set
- Steiner centers in graphs
- The Steiner number of a graph