Eulerian Graph
- Eulerian graph is the one which consists a Eulerian circuit.
- Eulerian circuit is a path which traverse each edge exactly once and return to the starting circuit.
This is different from Hamiltonian path as here we focus on edge and not on vertex.