scientific article; zbMATH DE number 3997549

zbMath0615.90071MaRDI QIDQ4724424

Ratko Tošić

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite connected graphsearch numbervertex-to-vertex search plan

Mathematics Subject Classification ID

Search theory (90B40) Graph theory (05C99)

Related Items (9)

Computing the one-visibility cop-win strategies for trees ⋮ Searching for an intruder on graphs and their subdivisions ⋮ A simple method for proving lower bounds in the zero-visibility cops and robber game ⋮ Limited visibility cops and robber ⋮ The one-visibility localization game ⋮ How to hunt an invisible rabbit on a graph ⋮ One-visibility cops and robber on trees ⋮ Computing the one-visibility copnumber of trees ⋮ One-visibility cops and robber on trees: optimal cop-win strategies

This page was built for publication: