Dirac's theorem states that if a graph has n vertices, n≥3, and the degree of each vertex is at least n/2, then the graph contains a Hamiltonian cycle.
Dirac's theorem states that if a graph has n vertices, n≥3, and the degree of each vertex is at least n/2, then the graph contains a Hamiltonian cycle.