An Introduction to Lazy Cops and Robbers on Graphs

DOI10.4169/college.math.j.48.5.322zbMath1443.97045OpenAlexW2770412887MaRDI QIDQ4581686

Nikolas Townsend, Mikayla L. Werzanski, Brendan W. Sullivan

Publication date: 20 August 2018

Published in: The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4169/college.math.j.48.5.322

zbMATH Keywords

pursuit-evasion gamegame on graphs

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57) Operations research, economics (aspects of mathematics education) (97M40) Combinatorics (educational aspects) (97K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Cops and invisible robbers: the cost of drunkenness
• Cops and robbers from a distance
• A game of cops and robbers
• Note on a pursuit game played on graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• Some pursuit-evasion problems on grids
• A game of cops and robbers played on products of graphs
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Cops and robbers in a random graph
• Cops and robbers is EXPTIME-complete
• Tandem-win graphs
• On Meyniel's conjecture of the cop number
• Chasing a Fast Robber on Planar Graphs and Random Graphs
• Lazy Cops and Robbers on Hypercubes
• On the minimum order of k-cop-win graphs

This page was built for publication: An Introduction to Lazy Cops and Robbers on Graphs