On Detours in Graphs1
- 1 June 1968
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 11 (2) , 195-201
- https://doi.org/10.4153/cmb-1968-022-8
Abstract
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 [3] 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.Keywords
This publication has 1 reference indexed in Scilit:
- Graphs with forbidden subgraphsJournal of Combinatorial Theory, Series B, 1971