Pages that link to "Item:Q4449518"
From MaRDI portal
The following pages link to On The Edge Geodetic Number Of A Graph (Q4449518):
Displaying 17 items.
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- On pitfalls in computing the geodetic number of a graph (Q2463833) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Comment on ``Edge geodetic covers in graphs'' (Q2812611) (← links)
- The edge fixed geodomination number of a graph (Q2881119) (← links)
- (Q3066319) (← links)
- Edge Conflicts do not Determine Geodesics in the Associahedron (Q4638997) (← links)
- Distinct edge geodetic decomposition in graphs (Q4957555) (← links)
- Edge geodetic self-decomposition in graphs (Q5858173) (← links)
- The edge geodetic number and Cartesian product of graphs (Q5893965) (← links)
- The Connected Edge-To-Vertex Geodetic Number of a Graph (Q6053086) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- CHELO INDEX FOR GRAPHS (Q6149000) (← links)
- Tension on an edge in a graph (Q6154653) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)