On the cop number of toroidal graphs

DOI10.1016/j.jctb.2021.06.008zbMath1473.05205arXiv1904.07946OpenAlexW3181621922MaRDI QIDQ1984519

Florian Lehner

Publication date: 16 September 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

pursuit-evasion gamegames on graphscops and robbercombinatorial came

Mathematics Subject Classification ID

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

Related Items (5)

On the cop number of graphs of high girth ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Bounding the Cop Number of a Graph by Its Genus ⋮ 4-cop-win graphs have at least 19 vertices ⋮ Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• A short note about pursuit games played on a graph with a given genus
• On a pursuit game played on graphs for which a minor is excluded
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Topological directions in cops and robbers
• A note on the cops and robber game on graphs embedded in non-orientable surfaces

This page was built for publication: On the cop number of toroidal graphs