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 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01083704
Contributor : Dimitrios M. Thilikos <>
Submitted on : Monday, November 17, 2014 - 5:14:41 PM
Last modification on : Thursday, November 15, 2018 - 7:51:05 PM
Long-term archiving on : Friday, April 14, 2017 - 3:38:45 PM

File

cmms - ICGT 2014.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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⟩

Share

Metrics

Record views

199

Files downloads

119