Helly theorems for 3-Steiner and 3-monophonic convexity in graphs

DOI10.1016/j.disc.2011.02.017zbMath1223.05158OpenAlexW2013441256MaRDI QIDQ534056

Yong-Cai Geng, Sumit K. Garg

Publication date: 10 May 2011

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.017

zbMATH Keywords

convexityHelly propertySteiner treeHelly numberminimal \(U\)-tree

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items

Some Steiner concepts on lexicographic products of graphs ⋮ Efficient realizations of closure systems ⋮ Monophonic convexity in weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• A Helly theorem for convexity in graphs
• Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
• On 3-Steiner simplicial orderings
• Distance-hereditary graphs
• A Radon theorem for Helly graphs
• A Helly theorem in weakly modular space
• Steiner intervals in graphs
• A Helly theorem for geodesic convexity in strongly dismantlable graphs
• Steiner Trees and Convex Geometries
• Convexity in Graphs and Hypergraphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Steiner distance in graphs
• Graph Classes: A Survey
• Steiner Distance-Hereditary Graphs
• On constructible graphs, locally Helly graphs, and convexity