Bounding the distance among longest paths in a connected graph (Q1699570)
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 6842981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the distance among longest paths in a connected graph |
scientific article; zbMATH DE number 6842981 |
Statements
Bounding the distance among longest paths in a connected graph (English)
0 references
23 February 2018
0 references
longest paths
0 references
path intersection
0 references
0 references
0.91859937
0 references
0.9056391
0 references
0.8992219
0 references
0 references
0.8979265
0 references
0.8968444
0 references
0.89541566
0 references
