Pages that link to "Item:Q5217086"
From MaRDI portal
The following pages link to Strong geodetic problem on complete multipartite graphs (Q5217086):
Displaying 10 items.
- Strong geodetic problem in grid-like architectures (Q723639) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- Strong geodetic problem in networks (Q2282484) (← links)
- Strong edge geodetic problem in networks (Q2409583) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS (Q5073975) (← links)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS (Q5075633) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)