Cop-win graphs with maximum capture-time

DOI10.1016/j.disc.2010.01.015zbMath1186.91051OpenAlexW2063843010MaRDI QIDQ968433

Tomáš Gavenčiak

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.01.015

zbMATH Keywords

combinatorial game theorycop and robber gamescapture-time

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (17)

Simultaneously moving cops and robbers ⋮ Capture times in the bridge-burning cops and robbers game ⋮ Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ Unnamed Item ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ The damage throttling number of a graph ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ The capture time of grids ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ The capture time of the hypercube ⋮ The impact of loops on the game of cops and robbers on graphs ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Capture-time extremal cop-win graphs ⋮ A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I ⋮ The optimal capture time of the one-cop-moves game

Cites Work

• Unnamed Item
• Unnamed Item
• Tarski's fixpoint lemma and combinatorial games
• An annotated bibliography on guaranteed graph searching
• The capture time of a graph
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs

This page was built for publication: Cop-win graphs with maximum capture-time