A path of maximum length in a graph G is referred to as a detour path of G and the length of such a path is called the detour number of G. It is not surprising that the study of detour paths is closely associated with the problem of investigating hamiltonian paths in graphs. Evidently few results have been obtained in this area, although Ore  has shown that any two detour paths intersect. It is the purpose of this article to further investigate these concepts. In particular, we obtain bounds for several graph theoretic parameters in terms of the detour number and also present formulae for the detour numbers of several important classes of graphs.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.