Search games with immobile hider (Q2366102)

A graph \(G\) is called ``weakly cyclic'' if no edge lies on two different cycles. A `quasi-Euler path' is a closed path of minimal length that visits all the points of \(G\). The authors consider a search game with immobile hider on weakly cyclic graphs. They prove the interesting and important result that the value of this game is half the length of a quasi-Euler path. This is a generalization of a result of the reviewer [``Search games'' (1980; Zbl 0439.90102)] concerning the search game on a tree.