Recommendations
Cites work
- scientific article; zbMATH DE number 4060740 (Why is no real title available?)
- Boundary vertices in graphs
- Canonical and monophonic convexities in hypergraphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Complement reducible graphs
- Computing simple-path convex hulls in hypergraphs
- Convex sets in graphs. II: Minimal path convexity
- Convexity and HHD-Free Graphs
- Convexity in Graphs and Hypergraphs
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Geodeticity of the contour of chordal graphs
- On geodetic sets formed by boundary vertices
- On the contour of graphs
- Rebuilding convex sets in graphs
Cited in
(12)- The boundary of a graph and its isoperimetric inequality
- On geodetic sets formed by boundary vertices
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- On the geodetic iteration number of the contour of a graph
- Computational and structural analysis of the contour of graphs
- Boundary-type sets in maximal outerplanar graphs
- New results of the geodeticity of the contour of a graph
- On the contour of graphs
- Geodeticity of the contour of chordal graphs
- Geodeticity of the contour of chordal bipartite graphs
- The contour of a bridged graph is geodetic
- On the contour of bipartite graphs
This page was built for publication: On the geodeticity of the contour of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479045)