Degree sums, \(k\)-factors and Hamilton cycles in graphs (Q1805370): Difference between revisions

The paper proves that if a 2-connected graph on \(n\) nodes with every pair of nonadjacent nodes having degree sum at least \(n-k\) has a \(k\)-factor, then the graph is Hamiltonian. This is a generalization of well-known results of Ore and Jackson.