R. Baldoni, F. Bonnet, A. Milani, and M. , Anonymous graph exploration without collision by mobile robots, Information Processing Letters, vol.109, issue.2, pp.98-103, 2008.
DOI : 10.1016/j.ipl.2008.08.011
URL : https://hal.archives-ouvertes.fr/inria-00333179

L. Barrì-ere, P. Flocchini, F. V. Fomin, P. Fraigniaud, N. Nisse et al., Connected graph searching, Information and Computation, vol.219, pp.1-16, 2012.
DOI : 10.1016/j.ic.2012.08.004

D. Bienstock, Graph searching, path-width, tree-width and related problems (a survey), DIMACS Ser. in Discr. Maths and Theoretical Comp. Sc, vol.5, pp.33-49, 1991.

D. Bienstock and P. D. Seymour, Monotonicity in graph searching, Journal of Algorithms, vol.12, issue.2, pp.239-245, 1991.
DOI : 10.1016/0196-6774(91)90003-H

L. Blin, J. Burman, and N. Nisse, Brief Announcement: Distributed Exclusive and Perpetual Tree Searching, 26th International Symposium on Distributed Computing (DISC), pp.403-404, 2012.
DOI : 10.1007/978-3-642-33651-5_29
URL : https://hal.archives-ouvertes.fr/hal-00741982

L. Blin, J. Burman, and N. Nisse, Exclusive graph searching
DOI : 10.1007/s00453-016-0124-0
URL : https://hal.archives-ouvertes.fr/hal-00845530

L. Blin, P. Fraigniaud, N. Nisse, and S. Vial, Distributed chasing of network intruders, Theoretical Computer Science, vol.399, issue.1-2, pp.12-37, 2008.
DOI : 10.1016/j.tcs.2008.02.004
URL : https://hal.archives-ouvertes.fr/hal-01310347

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, 24th Int. Symp. on Distributed Computing (DISC), pp.312-327, 2010.
DOI : 10.1007/978-3-642-15763-9_29
URL : https://hal.archives-ouvertes.fr/hal-00992700

R. L. Breisch, An intuitive approach to speleotopology, Southwestern Cavers, vol.6, pp.72-78, 1967.

R. L. Breisch, Lost in a Cave-applying graph theory to cave exploration, 2012.

D. Coudert, F. Huc, and D. Mazauric, A Distributed Algorithm for Computing the Node Search Number in Trees, Algorithmica, vol.47, issue.1, pp.158-190, 2012.
DOI : 10.1007/s00453-011-9524-3
URL : https://hal.archives-ouvertes.fr/inria-00587819

G. D. Angelo, G. D. Stefano, A. Navarra, N. Nisse, and K. Suchan, A unified approach for different tasks on rings in robot-based computing systems, 15th Workshop on Advances in Par. and Dist. Comp. Models (APDCM, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00845546

D. Dereniowski, From Pathwidth to Connected Pathwidth, SIAM Journal on Discrete Mathematics, vol.26, issue.4, pp.1709-1732, 2012.
DOI : 10.1137/110826424
URL : https://hal.archives-ouvertes.fr/hal-00573616

J. A. Ellis, I. H. Sudborough, and J. S. Turner, The Vertex Separation and Search Number of a Graph, Information and Computation, vol.113, issue.1, pp.50-79, 1994.
DOI : 10.1006/inco.1994.1064

P. Flocchini, M. J. Huang, and F. L. Luccio, Contiguous Search in the Hypercube for Capturing an Intruder, 19th IEEE International Parallel and Distributed Processing Symposium, 2005.
DOI : 10.1109/IPDPS.2005.151

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, 10th Int. Symp. on Algorithms and Computation (ISAAC), volume 1741 of LNCS, pp.93-102, 1999.
DOI : 10.1007/3-540-46632-0_10

F. V. Fomin, P. Heggernes, and R. Mihai, Mixed Search Number and Linear-Width of Interval and Split Graphs, Networks, vol.56, issue.3, pp.207-214, 2010.
DOI : 10.1007/978-3-540-74839-7_29

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

P. Heggernes and R. Mihai, Edge Search Number of Cographs in Linear Time, 3rd Int. Workshop on Frontiers in Algorithmics (FAW), pp.16-26, 2009.
DOI : 10.1007/978-3-540-73556-4_6

D. Ilcinkas, N. Nisse, and D. Soguet, The cost of monotonicity in distributed graph searching, pp.117-127, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00341415

N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, The complexity of searching a graph, Journal of the ACM, vol.35, issue.1, pp.18-44, 1988.
DOI : 10.1145/42267.42268

T. D. Parsons, The search number of a connected graph, 9th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Congress. Numer., XXI, pp.549-554, 1978.

S. Peng, C. Ho, T. Hsu, M. Ko, and C. Y. Tang, Edge and node searching problems on trees, Theoretical Computer Science, vol.240, issue.2, pp.429-446, 2000.
DOI : 10.1016/S0304-3975(99)00241-8

G. Prencipe, Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots, ICTCS, pp.154-171, 2001.
DOI : 10.1007/3-540-45446-2_10

K. Skodinis, Computing Optimal Linear Layouts of Trees in Linear Time, J. Algorithms, vol.47, issue.1, pp.40-59, 2003.
DOI : 10.1007/3-540-45253-2_37

K. Suchan and I. Todinca, Pathwidth of Circular-Arc Graphs, 33rd Int. Workshop on Graph-Theoretic Concepts in Computer Sc. (WG), pp.258-269, 2007.
DOI : 10.1007/978-3-540-74839-7_25
URL : https://hal.archives-ouvertes.fr/hal-00462302

B. Yang, D. Dyer, and B. Alspach, Sweeping graphs with large clique number, 15th Int. Symp. on Algorithms and Computation (ISAAC), pp.908-920, 2004.