Contraction Obstructions for Connected Graph Searching - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2014

Contraction Obstructions for Connected Graph Searching


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 monotone mixed search number and we deal with the the question weather 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. This set is finite, it consists of 174 graphs and completely characterizes the graphs with connected 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.
Fichier principal
Vignette du fichier
cmms - ICGT 2014.pdf (102.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01083704 , version 1 (17-11-2014)


  • HAL Id : lirmm-01083704 , version 1
  • ARXIV : 1410.8756


Best Micah J, Arvind Gupta, Dimitrios M. Thilikos, Dimitris Zoros. Contraction Obstructions for Connected Graph Searching. ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. ⟨lirmm-01083704⟩
145 View
134 Download



Gmail Facebook X LinkedIn More