Any Three Longest Paths In A Connected Graph Has A Common Vertex
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911866960216064 |
|---|---|
| author | Sarkar, Nirankush |
| author_facet | Sarkar, Nirankush |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2006_16245 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Any Three Longest Paths In A Connected Graph Has A Common Vertex Sarkar, Nirankush Combinatorics 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. |
| title | Any Three Longest Paths In A Connected Graph Has A Common Vertex |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2006.16245 |