The game of cops and robbers on directed graphs with forbidden subgraphs
From MaRDI portal
Publication:2155657
Abstract: The traditional game of cops and robbers is played on undirected graph. Recently, the same game played on directed graph is getting attention by more and more people. We knew that if we forbid some subgraph we can bound the cop number of the corresponding class of graphs. In this paper, we analyze the game of cops and robbers on -free digraphs. However, it is not the same as the case of undirected graph. So we give a new concept (-free) to get a similar conclusion about the case of undirected graph.
Recommendations
Cites work
- scientific article; zbMATH DE number 1665333 (Why is no real title available?)
- 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
- Cops and Robbers on Planar‐Directed Graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- On Meyniel's conjecture of the cop number
- On a pursuit game on Cayley digraphs
- The cops and robber game on graphs with forbidden (induced) subgraphs
- Variations on cops and robbers
- Vertex-to-vertex pursuit in a graph
- WHAT IS...Cop Number?
Cited in
(6)- The cops and robber game on graphs with forbidden (induced) subgraphs
- Generalized cops and robbers: a multi-player pursuit game on graphs
- Cops and robbers on graphs with a set of forbidden induced subgraphs
- Cops and Robber game with a fast robber on expander graphs and random graphs
- The impact of loops on the game of cops and robbers on graphs
- Cops and robbers on oriented graphs
This page was built for publication: The game of cops and robbers on directed graphs with forbidden subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155657)