1. I. Adler, Directed tree-width examples. J. Comb. Theory Ser. B 97, 718–725 (2007)
2. M. Aigner, M. Fromme, A game of cops and robbers. Discret. Appl. Math. 8, 1–12 (1984)
3. N. Alon, P. Pralat, R. Wormald, Cleaning regular graphs with brushes. SIAM J. Discret. Math. 23, 233–250 (2008)
4. B. Alspach, Sweeping and searching in graphs: a brief survey. Matematiche 5, 95–37 (2006)
5. B. Alspach, D. Dyer, D. Hanson, B. Yang, Arc searching digraphs without jumping, in Proceedings of the 1st International Conference on Combinatorial Optimization and Applications (COCOA’07), Xi’an, China, 2007