Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2006.16245 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- A question was raised in 1995 at the British Combinatorial Conference: Do any three longest paths in a connected graph have a vertex in common? In this paper, it is shown that the answer to that question is yes.