On the geodeticity of the contour of a graph
From MaRDI portal
Publication:479045
DOI10.1016/j.dam.2014.08.028zbMath1304.05027MaRDI QIDQ479045
Mauro Mezzini, Marina Moscarini
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.028
contour; geodesic convexity; cactus; geodetic set; geodetic-contour-preserving class; HHD-free graph
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
Related Items
The boundary of a graph and its isoperimetric inequality, The contour of a bridged graph is geodetic, On the geodetic iteration number of the contour of a graph, On the contour of bipartite graphs, Boundary-type sets in maximal outerplanar graphs, An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
Cites Work
- Unnamed Item
- On geodetic sets formed by boundary vertices
- Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs
- Canonical and monophonic convexities in hypergraphs
- Convex sets in graphs. II: Minimal path convexity
- Complement reducible graphs
- Boundary vertices in graphs
- Computing simple-path convex hulls in hypergraphs
- On the contour of graphs
- Geodeticity of the contour of chordal graphs
- Rebuilding convex sets in graphs
- Convexity in Graphs and Hypergraphs
- Convexity and HHD-Free Graphs
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT