Bounding the cop number of a graph by its genus
From MaRDI portal
Publication:6621170
Nathan Bowler, Florian Lehner, Joshua Erde, Max F. Pitz
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex-to-vertex pursuit in a graph
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- A Bound for the Cops and Robbers Problem
- 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
This page was built for publication: Bounding the cop number of a graph by its genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621170)
