scientific article; zbMATH DE number 5989957

zbMATH Open1229.91020MaRDI QIDQ3104264FDOQ3104264

Authors: Tomáš Gavenčiak 

Publication date: 19 December 2011

Title of this publication is not available (Why is that?)

Recommendations

• Cop-win graphs with maximum capture-time
• Capture-time extremal cop-win graphs
• On cop-win graphs
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• A cop-winning strategy on strongly cop-win graphs
• A note on \(k\)-cop-win graphs
• The capture time of a planar graph
• On bridged graphs and cop-win graphs
• On the minimum order of \(k\)-cop-win graphs
• A tight lower bound for the capture time of the cops and robbers game

zbMATH Keywords

game theorycop and robber gamescapture-time

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Cited In (11)

• Almost all cop-win graphs contain a universal vertex
• The capture time of a graph
• The capture time of a planar graph
• On cop-win graphs
• A note on \(k\)-cop-win graphs
• The capture time of grids
• Capture-time extremal cop-win graphs
• Cop-win graphs with maximum capture-time
• Lower bounds for the capture time: linear, quadratic, and beyond
• Cops and robbers ordinals of cop-win trees
• A game of cops and robbers on graphs with periodic edge-connectivity

This page was built for publication:

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