On cop-win graphs
From MaRDI portal
Publication:1850039
DOI10.1016/S0012-365X(02)00260-1zbMath1009.05085OpenAlexW1995612970MaRDI QIDQ1850039
François Laviolette, Geňa Hahn, Robert E. Woodrow, Norbert W. Sauer
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00260-1
Related Items (14)
Cop vs. gambler ⋮ A Helly theorem for geodesic convexity in strongly dismantlable graphs ⋮ Pursuit evasion on infinite graphs ⋮ TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS ⋮ Constructible graphs and pursuit ⋮ Containment: a variation of cops and robber ⋮ Limited visibility cops and robber ⋮ Capturing the drunk robber on a graph ⋮ A note on \(k\)-cop, \(l\)-robber games on graphs ⋮ The role of information in the cop-robber game ⋮ An annotated bibliography on guaranteed graph searching ⋮ Large classes of infinite k-cop-win graphs ⋮ The capture time of a graph ⋮ Conjectures on Cops and Robbers
This page was built for publication: On cop-win graphs
