Totally Disjoint Diametral Paths

In this paper, we study totally disjoint diametral paths in simple connected graphs.

A diametral path in a graph is a shortest path that connects two vertices whose mutual distance is equal to the diameter of the graph.

Totally disjoint paths are paths that have no vertices in common, including their end vertices.

We show that the problem of deciding whether a graph $G$ has $k$ totally disjoint diametral paths is NP-complete.

We consider restricted classes of graphs for which the problem of determining the maximum size of a set of totally disjoint diametral paths is readily solved.

We then give a linear-time algorithm for a subclass of maximal outerplanar graphs called 2-paths, define a polynomial-time algorithm for threshold graphs, and establish a structural bound for proper interval graphs.

Finally, we define classes of extremal graphs with $k$ totally disjoint diametral paths of length $d$ having the fewest possible number of edges.