Pages that link to "Item:Q1106237"
From MaRDI portal
The following pages link to Bridged graphs and geodesic convexity (Q1106237):
Displaying 17 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- On local convexity in graphs (Q1089354) (← links)
- On bridged graphs and cop-win graphs (Q1108291) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- Metric characterization of parity graphs (Q1182856) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Injective hulls of various graph classes (Q2155861) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- On the contour of graphs (Q2446313) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- CHARACTERISTIC PROPERTIES AND RECOGNITION OF GRAPHS IN WHICH GEODESIC AND MONOPHONIC CONVEXITIES ARE EQUIVALENT (Q4903647) (← links)
- Retracts of Products of Chordal Graphs (Q4920657) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
