A cop-winning strategy on strongly cop-win graphs

DOI10.1016/J.DISC.2023.113419MaRDI QIDQ6041547zbMATH OpenFDO

Authors Josée Desharnais, François Laviolette, Héli Marcoux, Norbert Polat

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2023.113419

zbMATH Keywords

cop-windismantling orderfast robberstrategystrongly cop-win graph

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Cop and robber games when the robber can hide and ride
• A game of cops and robbers
• Pursuit evasion on infinite graphs
• scientific article; zbMATH DE number 5241699
• Visibility graphs, dismantlability, and the cops and robbers game

Cites work

• A witness version of the cops and robber game
• Cop and robber games when the robber can hide and ride
• Randomized Pursuit-Evasion with Local Visibility
• Triangulated graphs and the elimination process
• Vertex-to-vertex pursuit in a graph

Cited in

(6)

• Visibility graphs, dismantlability, and the cops and robbers game
• A note on \(k\)-cop-win graphs
• Cop and robber games when the robber can hide and ride
• scientific article; zbMATH DE number 5989957 (Why is no real title available?)
• Pursuit evasion on infinite graphs
• Almost all cop-win graphs contain a universal vertex

This page was built for publication: A cop-winning strategy on strongly cop-win graphs

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