On a generalization of Meyniel's conjecture on the Cops and Robbers game
From MaRDI portal
Publication:625381
zbMath1205.05159MaRDI QIDQ625381
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231586
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (9)
Catching an infinitely fast robber on a grid ⋮ Catching a fast robber on the grid ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Spy game: FPT-algorithm and results on graph products ⋮ To satisfy impatient web surfers is hard ⋮ Spy-game on graphs: complexity and simple topologies ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Cops, a fast robber and defensive domination on interval graphs
This page was built for publication: On a generalization of Meyniel's conjecture on the Cops and Robbers game
