Cop-win graphs with maximum capture-time

DOI10.1016/J.DISC.2010.01.015MaRDI QIDQ968433zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 5989957
• Bounds on the length of a game of cops and robbers
• The capture time of a graph
• Capture-time extremal cop-win graphs
• A tight lower bound for the capture time of the cops and robbers game

Cites work

• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• A note on \(k\)-cop, \(l\)-robber games on graphs
• An annotated bibliography on guaranteed graph searching
• Searching and sweeping graphs: a brief survey
• Tarski's fixpoint lemma and combinatorial games
• The capture time of a graph
• Vertex-to-vertex pursuit in a graph

Cited in

(22)

• Cops and robber on oriented graphs with respect to push operation
• The optimal capture time of the one-cop-moves game
• scientific article; zbMATH DE number 5989957 (Why is no real title available?)
• A tight lower bound for the capture time of the cops and robbers game
• The capture time of a graph
• The capture time of a planar graph
• Throttling for the game of cops and robbers on graphs
• Game with Slow Pursuers on the Edge Graphs of Regular Simplexes
• Differential Game with Slow Pursuers on the Edge Graph of a Simplex
• Simultaneously moving cops and robbers
• Capture times in the bridge-burning cops and robbers game
• Bounds on the length of a game of cops and robbers
• The capture time of grids
• Capture-time extremal cop-win graphs
• Lower bounds for the capture time: linear, quadratic, and beyond
• The capture time of the hypercube
• The damage throttling number of a graph
• A tight lower bound for the capture time of the cops and robbers game
• The game of overprescribed Cops and Robbers played on graphs
• A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I
• The damage number of a graph
• The impact of loops on the game of cops and robbers on graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968433)