WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
2009 ◽
Vol 01
(01)
◽
pp. 115-120
◽
Keyword(s):
It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs where 7 longest paths do not share a common vertex. It was conjectured that any three longest paths in a connected graph have a vertex in common. In this note we prove the conjecture for outerplanar graphs and give sufficient conditions for the conjecture to hold in general.
1996 ◽
Vol 5
(4)
◽
pp. 429-436
◽
Keyword(s):
Keyword(s):
Keyword(s):
2018 ◽
Vol 12
(2)
◽
pp. 297-317
2019 ◽
Vol 19
(04)
◽
pp. 2050068
Keyword(s):