The game of cops and robbers on directed graphs with forbidden subgraphs
From MaRDI portal
Publication:2155657
DOI10.1007/S10255-022-1109-1zbMATH Open1492.05101arXiv2001.09853OpenAlexW3003028482MaRDI QIDQ2155657FDOQ2155657
Publication date: 15 July 2022
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2001.09853
Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Cops and robbers in graphs with large girth and Cayley graphs
- 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
- WHAT IS...Cop Number?
- A short note about pursuit games played on a graph with a given genus
- Title not available (Why is that?)
- On a pursuit game on Cayley digraphs
- Cops and Robbers on Planar‐Directed Graphs
- The Cops and Robber game on graphs with forbidden (induced) subgraphs
Cited In (3)
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)