Distance in graphs -- taking the long view (Q1772194): Difference between revisions

The title aims at the fact that the paper is concerned with the detour distance \(D(u,v)\) in connected graphs, which is (for different vertices \(u\) and \(v\)) the length of a longest path joining \(u\) and \(v\). The paper is a survey without proofs. After a short introduction Section 2 surveys fundamental facts on the detour distance mainly referring to two papers by \textit{G. Chartrand, H. Escuadro} and \textit{P. Zhang} [``Detour distance in graphs'' and ``Extremal problems on distances in graphs'', Congr. Numerantium 167, 133--147 (2004; Zbl 1064.05048)]. Section 3 considers connections to domination and is based on a recent paper by Chartrand, Haynes, Henning and Zhang. Section 4 combines the detour distance with (Hamiltonian) coloring and Hamiltonian connectedness and finally the detour number and geodesics (in graphs) are considered.