Publication:3418339
From MaRDI portal
zbMath1195.05019MaRDI QIDQ3418339
Publication date: 2 February 2007
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Searching for a Visible, Lazy Fugitive, Fast Robber in Planar Graphs, Digraph Decompositions and Monotonicity in Digraph Searching, Vertex Pursuit Games in Stochastic Network Models, Cops and robbers from a distance, Parameterized pursuit-evasion games, The capture time of grids, Digraph decompositions and monotonicity in digraph searching, Guard games on graphs: keep the intruder out!, How to guard a graph?, Connected searching of weighted trees, Strong-mixed searching and pathwidth, Time constrained graph searching, Cleaning a network with brushes, An annotated bibliography on guaranteed graph searching, Digraph searching, directed vertex separation and directed pathwidth, Monotonicity in digraph search problems, Parallel cleaning of a network with brushes, Cop-win graphs with maximum capture-time, A graph search algorithm for indoor pursuit/evasion, A witness version of the cops and robber game, The capture time of a graph, Sweeping graphs with large clique number, Pursuing a fast robber on a graph, Lower bounds on the pathwidth of some grid-like graphs, Chasing robbers on random graphs: Zigzag theorem, Large classes of infinite k-cop-win graphs
