1. There exists an Eulerian path in the graph; e.g. \(A → B → G → F → E → D → B → C → E → G → D → A\).
  2. There exists a Hamiltonian path in the graph, that is, a path where every vertex is passed once; e.g. \(A → B → C → E → F → G → D\).