Bridged graphs and geodesic convexity
From MaRDI portal
Publication:1106237
DOI10.1016/0012-365X(87)90100-2zbMATH Open0651.05043MaRDI QIDQ1106237FDOQ1106237
Authors: Martin Farber 
Publication date: 1987
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- On isometric subgraphs of infinite bridged graphs and geodesic convexity
- Geodesic Convexity in Graphs
- On diameters and radii of bridged graphs
- Hyperbolic bridged graphs
- Convexity, geodetic, and hull numbers of the join of graphs
- scientific article; zbMATH DE number 437485
- Geodesic geometry on graphs
- Geodetic convexity and Kneser graphs
- On geodesic transitive graphs
Cites Work
- Graph theory
- Title not available (Why is that?)
- On local convexity in graphs
- Convexity in Graphs and Hypergraphs
- On rigid circuit graphs
- Convex sets in graphs. II: Minimal path convexity
- Title not available (Why is that?)
- Conditions for invariance of set diameters under d-convexification in a graph
- Title not available (Why is that?)
- Geodesic subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Fast Robber in Planar Graphs
- Injective hulls of various graph classes
- Absolute retracts and varieties generated by chordal graphs
- Complexity aspects of the triangle path convexity
- On the geodetic iteration number of the contour of a graph
- On isometric subgraphs of infinite bridged graphs and geodesic convexity
- Consequences of an algorithm for bridged graphs
- On local convexity in graphs
- On bridged graphs and cop-win graphs
- On the contour of bipartite graphs
- Retracts of products of chordal graphs
- On diameters and radii of bridged graphs
- Hyperbolic bridged graphs
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products
- On the contour of graphs
- Helly-gap of a graph and vertex eccentricities
- Metric characterization of parity graphs
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Isometric cycles, cutsets, and crowning of bridged graphs
This page was built for publication: Bridged graphs and geodesic convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106237)
