5 citations · 5 across the 12 of their papers we have counts for
1 paper · 2 filters
Jan Ekstein, Shinya Fujita, Adam Kabela +1
It is easy to see that in a connected graph any 2 longest paths have a vertex in common. For k>=7, Skupien in [7] obtained a connected graph in which some k longest paths have no c…