Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4649380 | Discrete Mathematics | 2009 | 10 Pages |
Abstract
If every vertex of a graph is an endvertex of a hamiltonian path, then the graph is called homogeneously traceable. If we require each vertex of a graph to be an endvertex of a longest path (not necessarily a hamiltonian path), then we call the graph a detour homogeneous graph. The concept of a homogeneously traceable graph was extended to digraphs by Bermond, Simões-Pereira, and C.M. Zamfirescu. Skupień introduced different classes of such digraphs. In this paper we discuss the extension of the concept of a detour homogeneous graph to digraphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Susan van Aardt, Frank Bullock, Joanna Górska, Zdzisław Skupień,