Surrounding an active robber

DOI10.1007/S44007-026-00206-ZMaRDI QIDQ7294155zbMATH OpenFDO

Authors Nancy E. Clarke, Stephen Finbow, Todd Mullen

Publication date 10 July 2026

Published in La Matematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S44007-026-00206-Z

Mathematics Subject Classification ID

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

Cites work

• A game of cops and robbers
• A game of cops and robbers played on products of graphs
• Cops and an insightful robber
• Cops and robbers from a distance
• Cops that surround a robber
• Graph minors. II. Algorithmic aspects of tree-width
• Limited visibility cops and robber
• Most generalized Petersen graphs of girth 8 have cop number 4
• Tandem-win graphs
• The cops and robber game on graphs with forbidden (induced) subgraphs
• Trees with Hamiltonian square
• Vertex-to-vertex pursuit in a graph

Cited in

(1)

• Cops against a cheating robber

This page was built for publication: Surrounding an active robber

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294155)