Bounding the Cop Number of a Graph by Its Genus

DOI10.1137/20M1312150zbMath1477.05124arXiv1911.01758OpenAlexW3205354433MaRDI QIDQ5163511

Nathan Bowler, Max F. Pitz, Florian Lehner, Joshua Erde

Publication date: 4 November 2021

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

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

zbMATH Keywords

genuscops and robberspursuit games

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• A short note about pursuit games played on a graph with a given genus
• Vertex-to-vertex pursuit in a graph
• On the cop number of toroidal graphs
• Topological directions in cops and robbers
• A note on the cops and robber game on graphs embedded in non-orientable surfaces
• On Meyniel's conjecture of the cop number
• A Bound for the Cops and Robbers Problem

This page was built for publication: Bounding the Cop Number of a Graph by Its Genus