论文标题
连接图中的任何三个最长路径都有一个公共顶点
Any Three Longest Paths In A Connected Graph Has A Common Vertex
论文作者
论文摘要
1995年在英国组合会议上提出了一个问题：连接图中的三个最长的路径是否有一个共同点？在本文中，这表明该问题的答案是肯定的。
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.
