Meyniel's conjecture on the cop number: a survey
From MaRDI portal
Publication:1937358
DOI10.4310/JOC.2012.v3.n2.a6zbMath1276.05074arXiv1308.3385OpenAlexW2061413565WikidataQ55969525 ScholiaQ55969525MaRDI QIDQ1937358
Publication date: 28 February 2013
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3385
Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
A probabilistic version of the game of zombies and survivors on graphs, Catching a fast robber on the grid, An Introduction to Lazy Cops and Robbers on Graphs, On a characterization of evasion strategies for pursuit-evasion games on graphs, On the cop number of graphs of high girth, Visibility graphs, dismantlability, and the cops and robbers game, A tight lower bound for the capture time of the cops and robbers game, Cops that surround a robber, Lazy Cops and Robbers on Hypercubes, Cops and robber on subclasses of \(P_5\)-free graphs, On the cop number of toroidal graphs, Cops and robbers ordinals of cop-win trees, 4-cop-win graphs have at least 19 vertices, The game of cops and eternal robbers, Cops and robbers on directed and undirected abelian Cayley graphs, Hyperopic cops and robbers, Conjectures on Cops and Robbers, Meyniel extremal families of abelian Cayley graphs
