Ore's theorem
Sign in to savetheorem that a graph in which every two nonadjacent vertices have high degree sum must have a Hamiltonian cycle
Connections
Hamiltonian path
Entity
glossary of graph theory terms
Entity
Norway
Country
digital object identifier
Entity
graph theory
Entity
graph
Entity
JSTOR
Organization
complete graph
Entity
node
Entity
directed graph
Entity
degree
Entity
regular graph
Entity
Mathematical Reviews
Entity
Øystein Ore
Entity
complete bipartite graph
Entity
strongly connected component
Entity
American Mathematical Monthly
Entity
pancyclic graph
Entity
Journal of Combinatorial Theory
Entity
Ore condition
Entity