Cops that surround a robber

DOI10.1016/J.DAM.2020.06.019zbMath1447.05132arXiv1910.14200OpenAlexW3040924043MaRDI QIDQ2197471

Nancy E. Clarke, David A. Pike, Stephen Finbow, Peter Danziger, Caleb W. Jones, Rosalind A. Cameron, Andrea C. Burgess

Publication date: 31 August 2020

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

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

zbMATH Keywords

games on graphscops and robberspursuit-evasion on graphsgeneralised Petersen graphsproduct graphsgraphs arising from designs

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Cops and an insightful robber ⋮ A game theoretical approach for finding near-optimal solutions of an optimization problem ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Unnamed Item ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• A game of cops and robbers
• Cops and robbers in graphs with large girth and Cayley graphs
• On the cop number of a graph
• A game of cops and robbers played on products of graphs
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Containment: a variation of cops and robber
• Cops and robbers is EXPTIME-complete
• Pursuing a fast robber on a graph
• Containment game played on random graphs: another zig-zag theorem
• On the cop number of generalized Petersen graphs
• Cops and robbers playing on edges
• Cops and Robbers on Graphs Based on Designs
• Graph minors. II. Algorithmic aspects of tree-width
• Pursuit and evasion from a distance: algorithms and bounds
• The Cops and Robber game on graphs with forbidden (induced) subgraphs

This page was built for publication: Cops that surround a robber