On 3-Steiner simplicial orderings

DOI10.1016/j.disc.2008.05.047zbMath1221.05042OpenAlexW1988790243MaRDI QIDQ1045119

Ortrud R. Oellermann, Jose Cáceres

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.2008.05.047

zbMATH Keywords

Steiner treesSteiner convexity3-Steiner simplicial verticesLexBFS orderingsMCS orderingsSteiner intervals

Mathematics Subject Classification ID

Trees (05C05)

Related Items (8)

Generating and enumerating digitally convex sets of trees ⋮ Reconstructing trees from digitally convex sets ⋮ Some Steiner concepts on lexicographic products of graphs ⋮ On a local 3-Steiner convexity ⋮ Steiner convex sets and Cartesian product ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• Steiner intervals in graphs
• The Shapley value on convex geometries
• On the semi-perfect elimination
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Steiner Trees and Convex Geometries
• Convexity in Graphs and Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Graph Classes: A Survey
• Convexity and HHD-Free Graphs

This page was built for publication: On 3-Steiner simplicial orderings