Efficiently Patrolling Hamiltonian and Two-Connected Graphs