4 citations · 6 across the 4 of their papers we have counts for
7 papers
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…
On the isometric path partition problem
Paul Manuel
The isometric path cover (partition) problem of a graph is to find a minimum set of isometric paths which cover (partition) the vertex set of the graph. The isometric path cover (p…
Revisiting path-type covering and partitioning problems
Paul Manuel
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination proble…
The graph theory general position problem on some interconnection networks
Paul Manuel, Sandi Klavžar
Given a graph , the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant…
Graph theory general position problem
Paul Manuel, Sandi Klavžar
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the grid so that no three points lie on a line. Given a set of…
Strong geodetic problem in grid like architectures
Sandi Klavžar, Paul Manuel
A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If is a graph, then is the cardinality of a smallest ver…