Rebuilding convex sets in graphs
From MaRDI portal
Publication:2566140
DOI10.1016/j.disc.2005.03.020zbMath1070.05035WikidataQ105870584 ScholiaQ105870584MaRDI QIDQ2566140
Ortrud R. Oellermann, Alberto Márquez, Jose Cáceres, María Luz Puertas
Publication date: 22 September 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/34391
Distance; Convex hull; Extreme points; Eccentricity; Geodetic set; Contour vertex; Distance hereditary graph
Related Items
Simplicial Powers of Graphs, On the geodetic and the hull numbers in strong product graphs, Towards a new framework for domination, On geodetic sets formed by boundary vertices, Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs, On the geodetic number of median graphs, Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs, On the geodetic number and related metric sets in Cartesian product graphs, Simplicial powers of graphs, On the convexity number of graphs, Steiner distance and convexity in graphs, Geodeticity of the contour of chordal graphs, Some structural, metric and convex properties on the boundary of a graph, Convex Partitions of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Completely separable graphs
- Distance-hereditary graphs
- Parallel concepts in graph theory
- Homogeneously orderable graphs
- The Shapley value on convex geometries
- Convexity in Graphs and Hypergraphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- A characterization of ptolemaic graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- Graph Classes: A Survey
- Steiner Distance-Hereditary Graphs
- Geodetic sets in graphs
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES