The following pages link to Edge geodetic number of a graph (Q5421205):
Displayed 17 items.
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- The 2-edge geodetic number and graph operations (Q1925613) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Comment on "Edge Geodetic Covers in Graphs (Q2812611) (← links)
- Distinct edge geodetic decomposition in graphs (Q4957555) (← links)
- The forcing near geodetic number of a graph (Q4965896) (← links)
- The near geodetic number of a graph (Q5069962) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- On the edge geodetic and edge geodetic domination numbers of a graph (Q5212898) (← links)
- Edge geodetic self-decomposition in graphs (Q5858173) (← links)
- The edge Steiner number of a graph (Q5900509) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- Monitoring edge-geodetic sets: hardness and graph products (Q6094715) (← links)
- Monitoring edge-geodetic sets in graphs (Q6132539) (← links)
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH (Q6149022) (← links)