Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
From MaRDI portal
Publication:534056
DOI10.1016/J.DISC.2011.02.017zbMATH Open1223.05158OpenAlexW2013441256MaRDI QIDQ534056FDOQ534056
Authors: 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
Recommendations
Trees (05C05) Paths and cycles (05C38) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph Classes: A Survey
- Convexity in Graphs and Hypergraphs
- On rigid circuit graphs
- Steiner distance in graphs
- Distance-hereditary graphs
- A Helly theorem for convexity in graphs
- Title not available (Why is that?)
- On 3-Steiner simplicial orderings
- Steiner trees and convex geometries
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- On constructible graphs, locally Helly graphs, and convexity
- A Helly theorem in weakly modular space
- Steiner intervals in graphs
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- A Radon theorem for Helly graphs
- A Helly theorem for geodesic convexity in strongly dismantlable graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Steiner Distance-Hereditary Graphs
Cited In (8)
- Local \(3\)-monophonic convexity
- Separation properties of 3-Steiner and 3-monophonic convexity in graphs
- A Helly theorem for convexity in graphs
- Monophonic convexity in weighted graphs
- Efficient realizations of closure systems
- Some Steiner concepts on lexicographic products of graphs
- On the Helly number in \(P_3\)-convexity in graphs
- On a local 3-Steiner convexity
This page was built for publication: Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534056)
