The following pages link to (Q3615800):
Displaying 23 items.
- Complexity of determining the maximum infection time in the geodetic convexity (Q324866) (← links)
- Algorithmic complexity of a problem of idempotent convex geometry. (Q869763) (← links)
- Some remarks on the geodetic number of a graph (Q965962) (← links)
- Complexity results related to monophonic convexity (Q987671) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- On the convexity number of graphs (Q1926045) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- Geodetic number of powers of cycles (Q2333891) (← links)
- On the geodetic rank of a graph (Q2364865) (← links)
- Orientable convexity, geodetic and hull numbers in graphs (Q2486069) (← links)
- Geodetic convexity and Kneser graphs (Q2698271) (← links)
- On the convexity of paths of length two in undirected graphs (Q2839205) (← links)
- Geodesic Convexity in Graphs (Q2849538) (← links)
- (Q3140352) (← links)
- (Q4525268) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918409) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
