Lower Bounds for the Cop Number when the Robber is Fast

DOI10.1017/S0963548311000101zbMath1223.05191arXiv1007.1734OpenAlexW1984081854MaRDI QIDQ5199510

Abbas Mehrabian

Publication date: 16 August 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Catching a fast robber on the grid ⋮ To satisfy impatient web surfers is hard ⋮ The fast robber on interval and chordal graphs ⋮ Cops, a fast robber and defensive domination on interval graphs

Cites Work

• Cops and robbers in graphs with large girth and Cayley graphs
• Vertex-to-vertex pursuit in a graph
• Pursuing a fast robber on a graph

This page was built for publication: Lower Bounds for the Cop Number when the Robber is Fast