Euler Circuits- Integer definitions- An Eulerian circuit (or eulerian circuit) is a circuit that passes through every vertex of a graph and uses every edge exactly once...click here to read more.

Hamiltonian Circuits-
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected graph that visits each vertex exactly once. A Hamiltonian cycle....click here to read more.