In Eulerian graph there is a theorem that says if the graph has 0 or 2 vertex with odd degree then in the graph there is Eulerian path.
Also if the graph has 0 vertex with odd degree then in the graph there is Eulerian circuit.
There are other theorems like them but for Hamiltonian paths and Hamiltonian circuit? I tried to find them but I didn't find something.
