Graphs where every maximal path is maximum (Q1924151): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.1996.0048 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1996.0048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2094475111 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.1996.0048 / rank | |||
Normal rank | |||
Latest revision as of 12:59, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs where every maximal path is maximum |
scientific article |
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
