Match the following concepts related to Hamiltonian graphs with their correct descriptions:

List I List II

A. Hamiltonian Cycle 1. If the sum of the degrees of any two non-adjacent vertices is at least n, then the graph is Hamiltonian.

B. Dirac's Theorem 2. A path that visits every vertex exactly once but does not return to the starting vertex.

C. Hamiltonian Path 3. A graph with n vertices where each vertex has a degree of at least n/2 is Hamiltonian.

D. Ore's Theorem 4. A cycle that visits every vertex exactly once and returns to the starting vertex.

Choose the correct matches:

Question

List I	List II
A. Hamiltonian Cycle	1. If the sum of the degrees of any two non-adjacent vertices is at least n, then the graph is Hamiltonian.
B. Dirac's Theorem	2. A path that visits every vertex exactly once but does not return to the starting vertex.
C. Hamiltonian Path	3. A graph with n vertices where each vertex has a degree of at least n/2 is Hamiltonian.
D. Ore's Theorem	4. A cycle that visits every vertex exactly once and returns to the starting vertex.