Helly theorems for 3-Steiner and 3-monophonic convexity in graphs
From MaRDI portal
(Redirected from Publication:534056)
Recommendations
Cites work
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 4142072 (Why is no real title available?)
- scientific article; zbMATH DE number 4085714 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- A Helly theorem for convexity in graphs
- A Helly theorem for geodesic convexity in strongly dismantlable graphs
- A Helly theorem in weakly modular space
- A Radon theorem for Helly graphs
- Convexity in Graphs and Hypergraphs
- Distance-hereditary graphs
- Graph Classes: A Survey
- On 3-Steiner simplicial orderings
- On constructible graphs, locally Helly graphs, and convexity
- On rigid circuit graphs
- Steiner Distance-Hereditary Graphs
- Steiner distance in graphs
- Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs
- Steiner intervals in graphs
- Steiner trees and convex geometries
Cited in
(8)- On a local 3-Steiner convexity
- On the Helly number in \(P_3\)-convexity in graphs
- Local \(3\)-monophonic convexity
- Efficient realizations of closure systems
- Separation properties of 3-Steiner and 3-monophonic convexity in graphs
- Some Steiner concepts on lexicographic products of graphs
- Monophonic convexity in weighted graphs
- A Helly theorem for convexity in graphs
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)