Steiner intervals, geodesic intervals, and betweenness
From MaRDI portal
Publication:1045107
DOI10.1016/j.disc.2009.05.022zbMath1188.05058OpenAlexW2026338696MaRDI QIDQ1045107
Aleksandra Tepeh Horvat, Boštjan Brešar, Iztok Peterin, Joseph Mathews, Manoj Changat, G. Narasimha-Shenoi Prasanth
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.022
Related Items (7)
Some Steiner concepts on lexicographic products of graphs ⋮ A note on 3-Steiner intervals and betweenness ⋮ Unnamed Item ⋮ On a local 3-Steiner convexity ⋮ Convex sets in lexicographic products of graphs ⋮ Steiner convex sets and Cartesian product ⋮ The vertex steiner number of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
- Interval-regularity does not lead to interval monotonicity
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Local Steiner convexity
- The Steiner tree problem
- On uniformly geodetic graphs
- Steiner intervals in graphs
- Approximation schemes for NP-hard geometric optimization problems: a survey
- The induced path convexity, betweenness, and svelte graphs
- On the Steiner, geodetic and hull numbers of graphs
- Comment on ``The Steiner number of a graph by G. Chartrand and P. Zhang [Discrete Mathematics 242 (2002) 41--54]
- New proof of a characterization of geodetic graphs
- Steiner Numbers in Graphs
- Graph Classes: A Survey
- Convexity and HHD-Free Graphs
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Medians, Lattices, and Trees
- Geodetic graphs of diameter two
- Geodetic graphs of diameter two
- The Steiner number of a graph
This page was built for publication: Steiner intervals, geodesic intervals, and betweenness
