Graphs Where Every Maximal Path Is Maximum

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.