scientific article
From MaRDI portal
Publication:3565878
zbMath1196.05089MaRDI QIDQ3565878
Publication date: 7 June 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (24)
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Cops and robbers on intersection graphs ⋮ A probabilistic version of the game of zombies and survivors on graphs ⋮ Cops and robbers from a distance ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ Some remarks on cops and drunk robbers ⋮ Cops and Robber game with a fast robber on expander graphs and random graphs ⋮ Almost all cop-win graphs contain a universal vertex ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Cops that surround a robber ⋮ The localization number of designs ⋮ Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) ⋮ Cops and Robbers on diameter two graphs ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Throttling for the game of cops and robbers on graphs ⋮ Meyniel's conjecture holds for random graphs ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Cops and robbers on directed and undirected abelian Cayley graphs ⋮ A note on cops and robbers, independence number, domination number and diameter ⋮ Cops and Robbers on Graphs Based on Designs ⋮ Containment game played on random graphs: another zig-zag theorem ⋮ The optimal capture time of the one-cop-moves game ⋮ Meyniel extremal families of abelian Cayley graphs
This page was built for publication:
