Smallest Sets of Longest Paths with Empty Intersection
1996 ◽
Vol 5
(4)
◽
pp. 429-436
◽
Keyword(s):
It is shown that, for every integer v < 7, there is a connected graph in which some v longest paths have empty intersection, but any v – 1 longest paths have a vertex in common. Moreover, connected graphs having seven or five minimal sets of longest paths (longest cycles) with empty intersection are presented. A 26-vertex 2-connected graph whose longest paths have empty intersection is exhibited.
1980 ◽
Vol 32
(6)
◽
pp. 1325-1332
◽
Keyword(s):
2009 ◽
Vol 01
(01)
◽
pp. 115-120
◽
Keyword(s):
Keyword(s):
2018 ◽
Vol 12
(2)
◽
pp. 297-317
2019 ◽
Vol 19
(04)
◽
pp. 2050068
Keyword(s):
Keyword(s):