TOPICS
Search

Dirac's Theorem


A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.


See also

Hamiltonian Cycle

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Dirac's Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/DiracsTheorem.html

Subject classifications