Pages that link to "Item:Q2286132"
From MaRDI portal
The following pages link to Strong geodetic cores and Cartesian product graphs (Q2286132):
Displaying 6 items.
- Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes (Q1988584) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Strong edge geodetic problem on grids (Q2239003) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Strong geodetic problem on complete multipartite graphs (Q5217086) (← links)
- On the computational complexity of the strong geodetic recognition problem (Q6658857) (← links)
