Title of article :
Intersections of Longest Cycles in k-Connected Graphs
Author/Authors :
Chen، نويسنده , , Guantao and Faudree، نويسنده , , Ralph J and Gould، نويسنده , , Ronald J، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
LetGbe a connected graph, wherek⩾2. S. Smith conjectured that every two longest cycles ofGhave at leastkvertices in common. In this note, we show that every two longest cycles meet in at leastck3/5vertices, wherec≈0.2615.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
