Graphs where every maximal path is maximum (Q1924151)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graphs where every maximal path is maximum |
scientific article; zbMATH DE number 934818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs where every maximal path is maximum |
scientific article; zbMATH DE number 934818 |
Statements
Graphs where every maximal path is maximum (English)
0 references
21 April 1997
0 references
In 1974, C. Thomassen gave a characterization of all graphs in which each path is contained in a Hamiltonian path. Such graphs are of interest since they admit greedy algorithms for constructing Hamiltonian paths. For graphs without a Hamiltonian path, it is natural to ask whether each path is contained in a path of maximal length. In the present paper the author characterizes all connected graphs without a Hamiltonian path having this property.
0 references
characterization
0 references
Hamiltonian path
0 references
path of maximal length
0 references
0.8096362948417664
0 references
0.787821888923645
0 references
0.7775406837463379
0 references
