On cop-win dynamic graphs

DOI10.1016/j.dam.2024.06.008zbMATH Open1544.05068MaRDI QIDQ6585271

Gabriel Fortin-Leblanc, Geňa Hahn, Frank Ramamonjisoa

Publication date: 9 August 2024

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

zbMATH Keywords

dynamic graphsCop-and-Robber gamesgraphs searching

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Cops and robbers ordinals of cop-win trees
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs
• A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity

This page was built for publication: On cop-win dynamic graphs

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