Ore's theorem states that if a graph has n vertices, n≥3, and the sum of the degree of any two non-adjacent vertices is at least n, then the graph contains a Hamiltonian cycle.
Ore's theorem states that if a graph has n vertices, n≥3, and the sum of the degree of any two non-adjacent vertices is at least n, then the graph contains a Hamiltonian cycle.