Bridged graphs and geodesic convexity

DOI10.1016/0012-365X(87)90100-2zbMath0651.05043MaRDI QIDQ1106237

Martin Farber

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cycledistancebridged graphsgeodesically convex sets

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Complexity aspects of the triangle path convexity, On the geodetic iteration number of the contour of a graph, On local convexity in graphs, Fast Robber in Planar Graphs, Injective hulls of various graph classes, On bridged graphs and cop-win graphs, On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products, On diameters and radii of bridged graphs, Helly-gap of a graph and vertex eccentricities, On the contour of graphs, Metric characterization of parity graphs, CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT, On the contour of bipartite graphs, Retracts of Products of Chordal Graphs, Absolute retracts and varieties generated by chordal graphs, Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs, Consequences of an algorithm for bridged graphs

Cites Work

• On rigid circuit graphs
• On local convexity in graphs
• Convex sets in graphs. II: Minimal path convexity
• Geodesic subgraphs
• Conditions for invariance of set diameters under d-convexification in a graph
• Convexity in Graphs and Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item