G. Bacsó, Z. Tuza, and M. Voigt, Characterization of graphs dominated by induced paths, Discrete mathematics, vol.307, pp.822-826, 2007.

É. Birmelé, F. De-montgolfier, L. Planche, and L. Viennot, Decomposing a graph into shortest paths with bounded eccentricity, 28th International Symposium on Algorithms and Computation, vol.15, pp.1-15, 2017.

D. G. Corneil, S. Olariu, and L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph, Inf. Process. Lett, vol.54, pp.253-257, 1995.

D. G. Corneil, S. Olariu, and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput, vol.28, pp.1284-1297, 1999.

J. S. Deogun and D. Kratsch, Dominating pair graphs, SIAM Journal on Discrete Mathematics, vol.15, pp.353-366, 2002.

F. F. Dragan and A. Leitert, On the minimum eccentricity shortest path problem, Theoretical Computer Science, vol.694, pp.66-78, 2017.

D. Lokshtanov, Finding the longest isometric cycle in a graph, Discrete Applied Mathematics, vol.157, pp.2670-2674, 2009.

N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, pp.39-61, 1983.