Contraction Obstructions for Connected Graph Searching

Abstract : We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected (and monotone) mixed search number and we deal with the question whether the obstruction set, with respect of the contraction partial ordering, for those classes is finite. In general, there is no guarantee that those sets are finite, as graphs are not well quasi ordered under the contraction partial ordering relation. In this paper we provide the obstruction set for k=2, where k is the number of searchers we are allowed to use. This set is finite, it consists of 177 graphs and completely characterises the graphs with connected (and monotone) mixed search number at most 2. Our proof reveals that the “sense of direction” of an optimal search searching is important for connected search which is in contrast to the unconnected original case. We also give a double exponential lower bound on the size of the obstruction set for the classes where this set is finite.
Type de document :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2016, 209, pp.27-47. 〈10.1016/j.dam.2015.07.036〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01349860
Contributeur : Isabelle Gouat <>
Soumis le : vendredi 29 juillet 2016 - 08:19:18
Dernière modification le : vendredi 5 octobre 2018 - 21:14:01

Lien texte intégral

Identifiants

Collections

Citation

Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. Contraction Obstructions for Connected Graph Searching. Discrete Applied Mathematics, Elsevier, 2016, 209, pp.27-47. 〈10.1016/j.dam.2015.07.036〉. 〈lirmm-01349860〉

Partager

Métriques

Consultations de la notice

104