Follow
Any Three Longest Paths In A Connected Graph Has A Common Vertex. (arXiv:2006.16245v1 [math.CO]) http://arxiv.org/abs/2006.16245
Any Three Longest Paths In A Connected Graph Has A Common Vertex. (arXiv:2006.16245v1 [math.CO]) http://arxiv.org/abs/2006.16245