Distance in graphs - Taking the long view
Gary Chartrand, Ping Zhang · AKCE International Journal of Graphs and Combinatorics · 2004
The detour distance between two vertices u and v in a connected graph G is the length of a longest v u − path in G. We survey results and some open questions on detour distance, including connections of this distance to domination, coloring and Hamiltonian properties of graphs.