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

Ming-rui Liu, Mei Lu

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 VecH-free digraphs. However, it is not the same as the case of undirected graph. So we give a new concept (VecH*-free) to get a similar conclusion about the case of undirected graph.


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





Cites Work


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)