Longest paths joining given vertices in a graph (Q1088682)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3991539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest paths joining given vertices in a graph |
scientific article; zbMATH DE number 3991539 |
Statements
Longest paths joining given vertices in a graph (English)
0 references
1986
0 references
It is shown that results of \textit{S. C. Locke} [Thesis (1981)] and \textit{H. Enomoto} [Longest paths and large cycles in finite graphs, J. Graph Theory 8, 287-301 (1984; Zbl 0544.05044)] can be strengthened for certain restricted classes of graphs.
0 references
longest path
0 references
0.7214619517326355
0 references
0.7210476398468018
0 references
0.7186911106109619
0 references
