Rebuilding convex sets in graphs

DOI10.1016/j.disc.2005.03.020zbMath1070.05035OpenAlexW2126829018WikidataQ105870584 ScholiaQ105870584MaRDI QIDQ2566140

María Luz Puertas, Alberto Márquez, Jose Cáceres, Ortrud R. Oellermann

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

zbMATH Keywords

DistanceConvex hullExtreme pointsEccentricityGeodetic setContour vertexDistance hereditary graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (26)

The contour of a bridged graph is geodetic ⋮ On geodetic sets formed by boundary vertices ⋮ On the geodetic iteration number of the contour of a graph ⋮ Lexicographic product of digraphs and related boundary-type sets ⋮ On basic chordal graphs and some of its subclasses ⋮ Geodeticity of the contour of chordal bipartite graphs ⋮ Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs ⋮ On the convexity number of graphs ⋮ Convex Partitions of Graphs ⋮ Steiner distance and convexity in graphs ⋮ On the geodetic and the hull numbers in strong product graphs ⋮ On the contour of graphs ⋮ Towards a new framework for domination ⋮ On the geodeticity of the contour of a graph ⋮ On the geodetic number of median graphs ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ Boundary vertices of Cartesian product of directed graphs ⋮ On the contour of bipartite graphs ⋮ Geodeticity of the contour of chordal graphs ⋮ Boundary-type sets in maximal outerplanar graphs ⋮ Non-inclusion and other subclasses of chordal graphs ⋮ On the geodetic number and related metric sets in Cartesian product graphs ⋮ Boundary-type sets of strong product of directed graphs ⋮ Simplicial powers of graphs ⋮ Simplicial Powers of Graphs ⋮ Some structural, metric and convex properties on the boundary of a graph

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rebuilding convex sets in graphs