Conjectures on Cops and Robbers

DOI10.1007/978-3-319-31940-7_3zbMath1352.05126OpenAlexW2536086683MaRDI QIDQ5506774

Anthony Bonato

Publication date: 16 December 2016

Published in: Graph Theory (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.6568

zbMATH Keywords

cop number of a graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

A note on \(k\)-cop-win graphs ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4 ⋮ 4-cop-win graphs have at least 19 vertices ⋮ The one-cop-moves game on planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cops and robbers from a distance
• The capture time of grids
• The complexity of pursuit on a graph
• A game of cops and robbers
• The capture time of a graph
• A short note about pursuit games played on a graph with a given genus
• Cops and robbers in graphs with large girth and Cayley graphs
• On the cop number of a graph
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• On cop-win graphs
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers in a random graph
• The capture time of the hypercube
• Cops and robbers is EXPTIME-complete
• Pursuing a fast robber on a graph
• Dynamic cage survey
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Meyniel's conjecture holds for random graphs
• Cops and Robbers on Graphs Based on Designs
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• Large classes of infinite k-cop-win graphs
• A Bound for the Cops and Robbers Problem
• Lazy Cops and Robbers on Hypercubes
• A better bound for the cop number of general graphs
• WHAT IS...Cop Number?
• On the minimum order of k-cop-win graphs

This page was built for publication: Conjectures on Cops and Robbers