Assessing Hamiltonian Cycle Criteria
A Hamiltonian cycle in a graph is a cycle that visits every vertex exactly once. Define Dirac’s Theorem and explain how it provides a sufficient condition for the existence of a Hamiltonian cycle in a simple graph with n vertices (\(n \geq 3\)). Additionally, briefly compare this with the conditions required for an Eulerian trail.