Title of article
Graphs Where Every Maximal Path Is Maximum
Author/Authors
Tarsi، نويسنده , , Michael، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
21
From page
304
To page
324
Abstract
We give a complete characterization of all graphs in which every simple path is contained in a maximum path. Among Hamiltonian graphs, such graphs were previously characterized by C. Thomassen.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1996
Journal title
Journal of Combinatorial Theory Series B
Record number
1526151
Link To Document