A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung

Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,…) are derived, which prove the truth of Bondy’s (1980) famous conjecture for some variants significantly improving the result expected by the given hypothesis. Similarly, two new lower bounds for the circumference (the length of a longest cycle) are established for the reverse hypothesis proposed by Jung (2001).