P. Lalibarrì-ere, F. V. Flocchini, P. Fomin, N. Fraigniaud, N. Nisse et al., Connected graph searching, Information and Computation, vol.219, pp.1-16, 2012.

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, Exclusive Graph Searching, 21st Annual European Symposium on Algorithms (ESA), pp.181-192, 2013.
DOI : 10.1007/978-3-642-40450-4_16

URL : https://hal.archives-ouvertes.fr/hal-00845530

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. 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

V. Fedor, P. Fomin, R. Heggernes, and . Mihai, Mixed search number and linear-width of interval and split graphs, Networks, vol.56, issue.3, pp.207-214, 2010.

V. Fedor, D. M. Fomin, and . Thilikos, An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci, vol.399, issue.3, pp.236-245, 2008.

P. A. Golovach, P. Heggernes, and R. Mihai, Edge search number of cographs, Discrete Applied Mathematics, vol.160, issue.6, pp.734-743, 2012.
DOI : 10.1016/j.dam.2011.04.020

M. Lefteris, C. H. Kirousis, and . Papadimitriou, Searching and pebbling, Theoretical Computer Science, vol.47, issue.2, pp.205-218, 1986.

E. Markou, N. Nisse, and S. Pérennes, Exclusive Graph Searching vs
URL : https://hal.archives-ouvertes.fr/hal-00980877

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

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, Discrete Mathematics, vol.309, issue.18, pp.5770-5780, 2009.
DOI : 10.1016/j.disc.2008.05.033