B. Awerbuch, M. Betke, and M. Singh, Piecemeal graph learning by a mobile robot, Information and Computation, vol.152, pp.155-172, 1999.

E. Bampas, J. Chalopin, S. Das, J. Hackfeld, and C. Karousatou, Maximal exploration of trees with energy-constrained agents, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01523302

L. Barrì-ere, P. Flocchini, P. Fraigniaud, and N. Santoro, Rendezvous and election of mobile agents: Impact of sense of direction. Theory of Computing Systems, vol.40, pp.143-162, 2007.

H. Becha and P. Flocchini, Optimal construction of sense of direction in a torus by a mobile agent, Int. J. Found. Comput. Sci, vol.18, issue.3, pp.529-546, 2007.

M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, Proc. 30th ACM Symp. on Theory of Computing (STOC'98), pp.269-287, 1998.

M. Blum and D. Kozen, On the power of the compass (or, why mazes are easier to search than graphs), 19th Symposium on Foundations of Computer Science (FOCS'78), pp.132-142, 1978.

P. Brass, F. Cabrera-mora, A. Gasparri, and J. Xiao, Multirobot tree and graph exploration, IEEE Trans. Robotics, vol.27, issue.4, pp.707-717, 2011.

L. Budach, Automata and labyrinths. Math. Nachrichten, pp.195-282, 1978.

J. Chalopin, S. Das, and A. Kosowski, Constructing a map of an anonymous graph: Applications of universal sequences, 14th International Conference on Principles of Distributed Systems (OPODIS), vol.6490, pp.119-134, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00726071

J. Chalopin, S. Das, and N. Santoro, Rendezvous of mobile agents in unknown graphs with faulty links, Proceedings of 21st International Symposium on Distributed Computing (DISC), pp.108-122, 2007.

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-guided graph exploration by a finite automaton, ACM Trans. Algorithms, vol.4, issue.4, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00339772

J. Czyzowicz, D. Dereniowski, L. Gasieniec, R. Klasing, A. Kosowski et al., Collision-free network exploration, J. Comput. Syst. Sci, vol.86, pp.70-81, 2017.
URL : https://hal.archives-ouvertes.fr/hal-00736276

J. Czyzowicz, S. Dobrev, L. Gasieniec, D. Ilcinkas, J. Jansson et al., More efficient periodic traversal in anonymous undirected graphs, Theor. Comput. Sci, vol.444, pp.60-76, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00371489

J. Czyzowicz, A. Kosowski, and A. Pelc, How to meet when you forget: log-space rendezvous in arbitrary graphs, Distributed Computing, vol.25, issue.2, pp.165-178, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00725875

S. Das, D. Dereniowski, and C. Karousatou, Collaborative exploration of trees by energy-constrained mobile robots, Theory Comput. Syst, vol.62, issue.5, pp.1223-1240, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02082153

S. Das, D. Dereniowski, and P. Uznanski, Energy constrained depth first search. CoRR, abs/1709.10146, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02082201

S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro, Map construction of unknown graphs by multiple agents, Theoretical Computer Science, vol.385, issue.1-3, pp.34-48, 2007.

S. Das, P. Flocchini, A. Nayak, and N. Santoro, Effective elections for anonymous mobile agents, Proceeding of 17th International Symposium on Algorithms and Computation (ISAAC), pp.732-743, 2006.

S. Das, M. Mihalák, R. Srámek, E. Vicari, and P. Widmayer, Rendezvous of mobile agents when tokens fail anytime, Proc. 12th International Conference on Principles of Distributed Systems (OPODIS), pp.463-480, 2008.

X. Deng and C. H. Papadimitriou, Exploring an unknown graph, Journal of Graph Theory, vol.32, issue.3, pp.265-297, 1999.

D. Dereniowski, Y. Disser, A. Kosowski, D. Pajak, and P. Uzna´nskiuzna´nski, Fast collaborative graph exploration, Information and Computation, vol.243, pp.37-49, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01251826

Y. Dieudonne, A. Pelc, and D. Peleg, Gathering despite mischief, ACM Transactions on Algorithms, vol.11, issue.1, p.1, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01330397

K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, Tree exploration with little memory, Journal of Algorithms, vol.51, pp.38-63, 2004.

Y. Disser, J. Hackfeld, and M. Klimm, Undirected graph exploration with (log log n) pebbles, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.25-39, 2016.

S. Dobrev, P. Flocchini, R. Kralovic, P. Ruzicka, G. Prencipe et al., Black hole search in common interconnection networks, Networks, vol.47, issue.2, pp.61-71, 2006.

C. Duncan, S. G. Kobourov, and V. S. Kumar, Optimal constrained graph exploration, 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.807-814, 2001.

M. Dynia, J. Lopuszanski, and C. Schindelhauer, Why robots need maps, Proc. 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp.41-50, 2007.

P. Flocchini, M. J. Huang, and F. L. Luccio, Decontamination of hypercubes by mobile agents, Networks, vol.52, issue.3, pp.167-178, 2008.

P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc, Collective tree exploration. Networks, vol.48, pp.166-177, 2006.

P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, and D. Peleg, Graph exploration by a finite automaton, Theoretical Computer Science, vol.345, issue.2-3, pp.331-344, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00339763

A. Kosowski and A. Navarra, Graph decomposition for memoryless periodic exploration, Algorithmica, vol.63, issue.1-2, pp.26-38, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00725922

A. Menc, D. Pajak, and P. Uznanski, Time and space optimality of rotor-router graph exploration, Inf. Process. Lett, vol.127, pp.17-20, 2017.

C. Ortolf and C. Schindelhauer, Online multi-robot exploration of grid graphs with rectangular obstacles, 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp.27-36, 2012.

P. Panaite and A. Pelc, Exploring unknown undirected graphs, J. Algorithms, vol.33, pp.281-295, 1999.

O. Reingold, Undirected connectivity in log-space, J. ACM, vol.55, issue.4, 2008.

H. A. Rollik, Automaten in planaren graphen, Acta Informatica, vol.13, issue.3, pp.287-298, 1980.

. E. Cl and . Shannon, Presentation of a maze-solving machine, 8th Conference of the Josiah Macy Jr. Found. (Cybernetics), pp.173-180, 1951.

R. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.

M. Yamashita and T. Kameda, Computing on anonymous networks: Part icharacterizing the solvable cases, IEEE Trans. Parallel Distrib. Syst, vol.7, issue.1, pp.69-89, 1996.

V. Yanovski, I. A. Wagner, and A. M. Bruckstein, A distributed ant algorithm for efficiently patrolling a network, Algorithmica, vol.37, issue.3, pp.165-186, 2003.