Cops and Robbers on Graphs of Bounded Diameter

DOI10.1137/19M126606XzbMath1444.05096arXiv1912.07203OpenAlexW3036334686MaRDI QIDQ3300761

Seyyed Aliasghar Hosseini, Bojan Mohar, Fiachra Knox

Publication date: 30 July 2020

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

Full work available at URL: https://arxiv.org/abs/1912.07203

zbMATH Keywords

probabilistic methodbounded diameterCops and Robbers

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

The node cop‐win reliability of unicyclic and bicyclic graphs

Cites Work

• Unnamed Item
• Cops and Robbers on diameter two graphs
• Vertex-to-vertex pursuit in a graph
• On Meyniel's conjecture of the cop number
• A Bound for the Cops and Robbers Problem