There is another way to check for Hamiltonian graph

**If we are able to make degree of each vertex in graph** **exactly** **2** **by** **deleting** **some** **of the edges, then graph is** **Hamiltonian**

Delete edge BD and DC, we will get a 2-regular graph, hence Hamiltonian