scientific article

Anthony Bonato, Richard J. Nowakowski

Publication date: 7 September 2011

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

complexity random graphs graph algorithms infinite graphs cops and robber games games on graphs, random graphs

Random graphs (graph-theoretic aspects) (05C80) 2-person games (91A05) Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Games on graphs (graph-theoretic aspects) (05C57) Infinite graphs (05C63)

Related Items (only showing first 100 items - show all)

On generalised Petersen graphs of girth 7 that have cop number 4 ⋮ Cops and Robbers on Geometric Graphs ⋮ Searching for a Non-adversarial, Uncooperative Agent on a Cycle ⋮ Game with Slow Pursuers on the Edge Graphs of Regular Simplexes ⋮ A survey of graph burning ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Differential Game with Slow Pursuers on the Edge Graph of a Simplex ⋮ The damage throttling number of a graph ⋮ Evacuating an Equilateral Triangle in the Face-to-Face Model ⋮ An Introduction to Lazy Cops and Robbers on Graphs ⋮ Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Pebble guided optimal treasure hunt in anonymous graphs ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ Toward multi-target self-organizing pursuit in a partially observable Markov game ⋮ A simple logic of the hide and seek game ⋮ The node cop‐win reliability of unicyclic and bicyclic graphs ⋮ The one-visibility localization game ⋮ Coarse geometry of the cops and robber game ⋮ On the zombie number of various graph classes ⋮ The localization game on oriented graphs ⋮ Edge searching and fast searching with constraints ⋮ Fast Searching on Complete k-partite Graphs ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Open Problems on Search Games ⋮ A note on hyperopic cops and robber ⋮ The localization number of designs ⋮ Cops and robber game on infinite chessboard ⋮ Lazy Cops and Robbers on Hypercubes ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Fast searching on cactus graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Conjecture of the Smallest 3-Cop-Win Planar Graph ⋮ Fast Searching on Cartesian Products of Graphs ⋮ A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity ⋮ Cops and Robbers on Graphs of Bounded Diameter ⋮ Shape recognition by a finite automaton robot ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Cops and robber on some families of oriented graphs ⋮ Fundamental Groupoids for Graphs ⋮ Vertex-edge domination in graphs ⋮ Bounding the Cop Number of a Graph by Its Genus ⋮ Most Generalized Petersen graphs of girth 8 have cop number 4 ⋮ Revolutionaries and Spies on Random Graphs ⋮ Forming tile shapes with simple robots ⋮ Fully Active Cops and Robbers ⋮ Unnamed Item ⋮ Fast two-robot disk evacuation with wireless communication ⋮ Reviews ⋮ Meyniel's conjecture holds for random graphs ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Variations of cops and robbers game on grids ⋮ Unnamed Item ⋮ A paradox for expected hitting times ⋮ Conjectures on Cops and Robbers ⋮ How to Burn a Graph ⋮ Cops and Robbers on Graphs Based on Designs ⋮ To catch a falling robber ⋮ Cop vs. gambler ⋮ General cops and robbers games with randomness ⋮ Cops and robber on butterflies and solid grids ⋮ Hunting rabbits on the hypercube ⋮ Localization game on geometric and planar graphs ⋮ A deterministic version of the game of zombies and survivors on graphs ⋮ Computability and the game of cops and robbers on graphs ⋮ On the subtle nature of a simple logic of the hide and seek game ⋮ Cops and robbers on intersection graphs ⋮ Computing the one-visibility cop-win strategies for trees ⋮ A simple method for proving lower bounds in the zero-visibility cops and robber game ⋮ A probabilistic version of the game of zombies and survivors on graphs ⋮ Lower and upper competitive bounds for online directed graph exploration ⋮ Pursuit evasion on infinite graphs ⋮ Catching an infinitely fast robber on a grid ⋮ Constructible graphs and pursuit ⋮ On the cop number of generalized Petersen graphs ⋮ Cops and an insightful robber ⋮ The robot crawler graph process ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ Burning a graph is hard ⋮ A robber locating strategy for trees ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ The guarding game is E-complete ⋮ Some remarks on cops and drunk robbers ⋮ Cops and Robber game with a fast robber on expander graphs and random graphs ⋮ Limited visibility cops and robber ⋮ Game of cops and robbers in oriented quotients of the integer grid ⋮ Evacuating two robots from multiple unknown exits in a circle ⋮ Selfish cops and active robber: multi-player pursuit evasion on graphs ⋮ How to hunt an invisible rabbit on a graph ⋮ Directed elimination games ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ The complexity of zero-visibility cops and robber

This page was built for publication: