The following pages link to Geodesic Convexity in Graphs (Q2849538):
Displaying 50 items.
- Complexity aspects of the triangle path convexity (Q277613) (← links)
- Near-linear-time algorithm for the geodetic Radon number of grids (Q299103) (← links)
- Geodeticity of the contour of chordal bipartite graphs (Q324794) (← links)
- A note on path domination (Q339493) (← links)
- Graphs with 4-Steiner convex balls (Q514932) (← links)
- Convex sets in lexicographic products of graphs (Q659762) (← links)
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Complexity aspects of \(\ell\)-chord convexities (Q777442) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- On the geodesic pre-hull number of a graph (Q1024319) (← links)
- Bridged graphs and geodesic convexity (Q1106237) (← links)
- Geodesic convexity in discrete spaces (Q1338849) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Toll number of the strong product of graphs (Q1712528) (← links)
- Steiner convex sets and Cartesian product (Q1746705) (← links)
- On the contour of bipartite graphs (Q1752491) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Strong geodetic number of graphs and connectivity (Q1988559) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Toll number of the Cartesian and the lexicographic product of graphs (Q2012538) (← links)
- Boundary-type sets in maximal outerplanar graphs (Q2026335) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- Convex and quasiconvex functions in metric graphs (Q2070539) (← links)
- Convex geometries over induced paths with bounded length (Q2092354) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- The geodesic classification problem on graphs (Q2132333) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Computing the hull number in toll convexity (Q2159554) (← links)
- A note on the convexity number of the complementary prisms of trees (Q2161269) (← links)
- On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
- On the toll number of a graph (Q2172405) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- A note on the geodetic number and the Steiner number of AT-free graphs (Q2220867) (← links)
- Toll convexity (Q2255809) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Strong geodetic cores and Cartesian product graphs (Q2286132) (← links)
- Convex median and anti-median at prescribed distance (Q2359804) (← links)
- Inapproximability results and bounds for the Helly and Radon numbers of a graph (Q2410232) (← links)
- Geodeticity of the contour of chordal graphs (Q2482108) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Geodetic convexity and Kneser graphs (Q2698271) (← links)
- The geometry of convex affine maximal graphs (Q2774473) (← links)
- Helly and exchange numbers of geodesic and Steiner convexities in lexicographic product of graphs (Q2788726) (← links)
- (Q3140352) (← links)
- Continuous average Straightness in spatial graphs (Q3388884) (← links)
- (Q3615800) (← links)
- Triple convexities for graphs (Q3970497) (← links)
- (Q4023716) (← links)
