A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Bondy conjectured a common generalization of various results in hamiltonian graph theory concerning Hamilton and dominating cycles by introducing a notion of PD λ -cycles (cycles that dominate all paths of lengths at least λ). We show that the minimum degree version of Bondy's conjecture is true (along with the reverse version) if PD λ -cycles are replaced by CD λ -cycles (cycles that dominate all cycles of lengths at least λ). Fraisse proved a minimum degree generalization including a theoremdoi:10.1016/j.disc.2008.03.011 fatcat:vz3cqivbynerzgjdzcfadypykq