Steiner Trees and Convex Geometries

DOI10.1137/070691383zbMath1191.05037OpenAlexW2023027771MaRDI QIDQ3563934

No author found.

Publication date: 1 June 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070691383

zbMATH Keywords

convex geometriesSteiner distanceSteiner intervalsSteiner convex sets

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Perfect graphs (05C17)

Related Items (12)

Generating and enumerating digitally convex sets of trees ⋮ A general framework for path convexities ⋮ Reconstructing trees from digitally convex sets ⋮ Computing simple-path convex hulls in hypergraphs ⋮ Graphs with a minimal number of convex sets ⋮ Steiner convex sets and Cartesian product ⋮ A Steiner general position problem in graph theory ⋮ Helly theorems for 3-Steiner and 3-monophonic convexity in graphs ⋮ Separation properties of 3-Steiner and 3-monophonic convexity in graphs ⋮ Local Steiner convexity ⋮ On 3-Steiner simplicial orderings ⋮ On the spectrum and number of convex sets in graphs

This page was built for publication: Steiner Trees and Convex Geometries