






















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。