Bounding the cop number of a graph by its genus

MaRDI QIDQ6621170FDOQ6621170

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

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Recommendations

• Bounding the cop number of a graph by its genus
• scientific article; zbMATH DE number 1665333
• Topological directions in cops and robbers
• A note on the cops and robber game on graphs embedded in non-orientable surfaces
• A bound for the cops and robbers problem

Mathematics Subject Classification ID

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

• Vertex-to-vertex pursuit in a graph
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• The game of cops and robbers on graphs
• 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
• Title not available (Why is that?)

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)