Locating pairs of vertices on Hamiltonian cycles

Ralph J. Faudree, Hao Li
2012 Discrete Mathematics  
Given a fixed positive integer k ≥ 2 and a fixed pair of vertices x and y in a graph of sufficiently large order n = n(k), minimum degree conditions that imply the existence of a Hamiltonian cycle C such that the distance on the cycle C between x and y is precisely k will be proved.
doi:10.1016/j.disc.2012.02.006 fatcat:4ieoojaycjgszenc6cnv77demm