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
Games involving graphs (91A43) Paths and cycles (05C38) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (13)
The game of cops and robbers on directed graphs with forbidden subgraphs ⋮ On the hat guessing number of a planar graph class ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Cops and robbers on graphs with a set of forbidden induced subgraphs ⋮ Cops that surround a robber ⋮ Cops and robber on subclasses of \(P_5\)-free graphs ⋮ The one-cop-moves game on graphs with some special structures ⋮ Unnamed Item ⋮ Cops and robber on some families of oriented graphs ⋮ Cops and robbers on \(2K_2\)-free graphs ⋮ Study of a combinatorial game in graphs through linear programming ⋮ An application of the Gyárfás path argument ⋮ Zero-visibility cops and robber and the pathwidth of a graph
This page was built for publication: The Cops and Robber game on graphs with forbidden (induced) subgraphs
