A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Locating pairs of vertices on Hamiltonian cycles
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