If a graph has graph vertices such that every pair of the graph vertices which are not joined by a graph edge has a sum of valences which is , then is Hamiltonian.
A graph satisfying Ore's criterion is known as an Ore graph.
If a graph has graph vertices such that every pair of the graph vertices which are not joined by a graph edge has a sum of valences which is , then is Hamiltonian.
A graph satisfying Ore's criterion is known as an Ore graph.
Weisstein, Eric W. "Ore's Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/OresTheorem.html