The Cops and Robber game on graphs with forbidden (induced) subgraphs
From MaRDI portal
Publication:5265407
zbMath1317.05121arXiv0804.4145MaRDI QIDQ5265407
Dirk Oliver Theis, Marcin Kaminski, Gwenaël Joret
Publication date: 24 July 2015
Full work available at URL: https://arxiv.org/abs/0804.4145
91A43: Games involving graphs
05C38: Paths and cycles
91A24: Positional games (pursuit and evasion, etc.)
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Cops and robber on some families of oriented graphs, Study of a combinatorial game in graphs through linear programming, Cops and robbers on graphs with a set of forbidden induced subgraphs, Cops that surround a robber, The one-cop-moves game on graphs with some special structures, Cops and robbers on \(2K_2\)-free graphs, An application of the Gyárfás path argument, Zero-visibility cops and robber and the pathwidth of a graph