The following pages link to On local convexity in graphs (Q1089354):
Displaying 50 items.
- The contour of a bridged graph is geodetic (Q266844) (← links)
- On the geodetic iteration number of the contour of a graph (Q277655) (← links)
- Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
- On the Carathéodory number of interval and graph convexities (Q392186) (← links)
- Bucolic complexes (Q392957) (← links)
- Inapproximability results for graph convexity parameters (Q496002) (← links)
- On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
- On a local 3-Steiner convexity (Q648980) (← links)
- On geodetic sets formed by boundary vertices (Q819808) (← links)
- The maximum infection time in the geodesic and monophonic convexities (Q897893) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- Local Steiner convexity (Q1024317) (← links)
- On the null-homotopy of bridged graphs (Q1099187) (← links)
- Bridged graphs and geodesic convexity (Q1106237) (← links)
- On bridged graphs and cop-win graphs (Q1108291) (← links)
- On diameters and radii of bridged graphs (Q1117245) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Metric characterization of parity graphs (Q1182856) (← links)
- Separation of two convex sets in convexity structures (Q1331267) (← links)
- A note on \(r\)-dominating cliques (Q1382816) (← links)
- Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477) (← links)
- Distances in benzenoid systems: Further developments (Q1584454) (← links)
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
- On the Steiner, geodetic and hull numbers of graphs (Q1779492) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Hyperbolic bridged graphs (Q1864582) (← links)
- Fixed finite subgraph theorems in infinite weakly modular graphs (Q1877668) (← links)
- Induced path transit function, monotone and Peano axioms (Q1887635) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Characterizations of \(L\)-convex spaces via domain theory (Q2036808) (← links)
- Convex and quasiconvex functions in metric graphs (Q2070539) (← links)
- Distance labeling schemes for \(K_4\)-free bridged graphs (Q2105446) (← links)
- A general framework for path convexities (Q2156285) (← links)
- Toll convexity (Q2255809) (← links)
- On the parameterized complexity of the geodesic hull number (Q2272396) (← links)
- Partitioning a graph into convex sets (Q2275456) (← links)
- Characterizations of convex spaces and anti-matroids via derived operators (Q2278365) (← links)
- Selfishness of convex bodies and discrete point sets (Q2311383) (← links)
- Lattice-equivalence of convex spaces (Q2311873) (← links)
- The algebra of metric betweenness. I: Subdirect representation and retraction (Q2372427) (← links)
- Eccentricity approximating trees (Q2410233) (← links)
- The Carathéodory number of the \(P_3\) convexity of chordal graphs (Q2449132) (← links)
- On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs (Q2497466) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Domination and convexity problems in the target set selection model (Q2689641) (← links)
- (Q2857327) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Eccentricity Approximating Trees (Q3181054) (← links)
