R. Aleliunas, R. M. Karp, R. Lipton, L. Lovász, and C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.218-223, 1979.
DOI : 10.1109/SFCS.1979.34

C. Ambühl, L. G?sieniec, A. Pelc, T. Radzik, and X. Zhang, Tree exploration with logarithmic memory, ACM Transactions on Algorithms, vol.7, issue.2, pp.1-1721, 2011.
DOI : 10.1145/1921659.1921663

D. Angluin, Local and global properties in networks of processors, pp.82-93, 1980.

P. Boldi and S. Vigna, An Effective Characterization of Computability in Anonymous Networks, DISC 2001, pp.33-47, 2001.
DOI : 10.1007/3-540-45414-4_3

J. Chalopin, E. Godard, and Y. Métivier, Election in partially anonymous networks with arbitrary knowledge in message passing systems, Distributed Computing, vol.10, issue.9, pp.297-311, 2012.
DOI : 10.1007/s00446-012-0163-y
URL : https://hal.archives-ouvertes.fr/hal-00695944

J. Chalopin, E. Godard, and A. Naudin, Anonymous Graph Exploration with Binoculars, Tech. rep, 2015.
DOI : 10.1007/978-3-662-48653-5_8
URL : https://hal.archives-ouvertes.fr/hal-01206140

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-guided graph exploration by a finite automaton, ICALP 2005, pp.335-346, 2005.
DOI : 10.1145/1383369.1383373
URL : https://hal.archives-ouvertes.fr/hal-00339772

S. Das, Mobile agents in distributed computing: Network exploration, Bulletin of the EATCS, vol.109, pp.54-69, 2013.

K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, Tree exploration with little memory, Journal of Algorithms, vol.51, issue.1, pp.38-63, 2004.
DOI : 10.1016/j.jalgor.2003.10.002

S. Guilbault and A. Pelc, Gathering asynchronous oblivious agents with local vision in regular bipartite graphs, Theoretical Computer Science, vol.509, pp.86-96, 2013.
DOI : 10.1016/j.tcs.2012.07.004

L. G?sieniec and T. Radzik, Memory Efficient Anonymous Graph Exploration, WG 2008, pp.14-29, 2008.
DOI : 10.1137/0405007

W. Haken, Connections Between Topological and Group Theoretical Decision Problems, Studies in Logic and the Foundations of Mathematics, pp.427-441, 1973.
DOI : 10.1016/S0049-237X(08)71911-6

A. Hatcher, Algebraic topology, 2002.

D. Ilcinkas, Setting port numbers for fast graph exploration, Theor. Comput. Sci, vol.40113, pp.236-242, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00339843

M. Koucký, Universal traversal sequences with backtracking, Journal of Computer and System Sciences, vol.65, issue.4, pp.717-726, 2002.
DOI : 10.1016/S0022-0000(02)00023-5

E. Kranakis, D. Krizanc, and E. Markou, The Mobile Agent Rendezvous Problem in the Ring. Synthesis lectures on distributed computing theory, 2010.

D. B. Lange and M. Oshima, Seven good reasons for mobile agents, Communications of the ACM, vol.42, issue.3, pp.88-89, 1999.
DOI : 10.1145/295685.298136

R. Lyndon and P. Schupp, Combinatorial Group Theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, 1977.
DOI : 10.1007/978-3-642-61896-3

O. Reingold, Undirected connectivity in log-space, Journal of the ACM, vol.55, issue.4, 2008.
DOI : 10.1145/1391289.1391291

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568