4 citations · 7 across the 11 of their papers we have counts for
Showing 2021 · math.COShow all
2 papers · 2 filters
math.CO2021
The geodesic transversal problem on some networks
Paul Manuel, Bostjan Bresar, Sandi Klavzar
A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in ce…
math.CO2021
The geodesic-transversal problem
Paul Manuel, Boštjan Brešar, Sandi Klavžar
A maximal geodesic in a graph is a geodesic (alias shortest path) which is not a subpath of a longer geodesic. The geodesic-transversal problem in a graph is introduced as the…