The impact of loops on the game of cops and robbers on graphs

DOI10.1016/j.disc.2018.10.010zbMath1403.05098OpenAlexW2904893131WikidataQ128741247 ScholiaQ128741247MaRDI QIDQ1712543

David Ellison

Publication date: 22 January 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.010

zbMATH Keywords

games on graphscops and robberscop number

Mathematics Subject Classification ID

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

Cites Work

• A game of cops and robbers
• Cop-win graphs with maximum capture-time
• The capture time of a graph
• Gibbs measures and dismantlable graphs
• A game of cops and robbers played on products of graphs
• Vertex-to-vertex pursuit in a graph

This page was built for publication: The impact of loops on the game of cops and robbers on graphs