On the Intersections of Longest Cycles in a Graph
On the Intersections of Longest Cycles in a Graph
We confirm a conjecture, due to Grötschel, regarding the intersection vertices of two longest cycles in a graph. In particular, we show that if G is a graph of circumference at least k + 1, where k ∊ {6,7}, and G has two longest cycles meeting in a set W …