scientific article
From MaRDI portal
Publication:3418339
zbMath1195.05019MaRDI QIDQ3418339
Publication date: 2 February 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (70)
Variations on cops and robbers ⋮ Bounding the search number of graph products ⋮ Cops and robber on butterflies and solid grids ⋮ The capture time of a planar graph ⋮ Fast Robber in Planar Graphs ⋮ Digraph Decompositions and Monotonicity in Digraph Searching ⋮ On Meyniel's conjecture of the cop number ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ Searching for an intruder on graphs and their subdivisions ⋮ Strong-mixed searching and pathwidth ⋮ Cops and robbers from a distance ⋮ Parameterized pursuit-evasion games ⋮ Cops and invisible robbers: the cost of drunkenness ⋮ The guarding game is E-complete ⋮ Locating a robber on a graph via distance queries ⋮ Some remarks on cops and drunk robbers ⋮ The capture time of grids ⋮ Connected search for a lazy robber ⋮ On the Capture Time of Cops and Robbers Game on a Planar Graph ⋮ Edge searching and fast searching with constraints ⋮ Fast Searching on Complete k-partite Graphs ⋮ Visibility graphs, dismantlability, and the cops and robbers game ⋮ Almost all cop-win graphs contain a universal vertex ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Edge degeneracy: algorithmic and structural results ⋮ Fast searching on cactus graphs ⋮ Digraph decompositions and monotonicity in digraph searching ⋮ To satisfy impatient web surfers is hard ⋮ The one-cop-moves game on graphs with some special structures ⋮ Guard games on graphs: keep the intruder out! ⋮ How to guard a graph? ⋮ On the Conjecture of the Smallest 3-Cop-Win Planar Graph ⋮ Time constrained graph searching ⋮ Cleaning a network with brushes ⋮ An annotated bibliography on guaranteed graph searching ⋮ Cops and robber on some families of oriented graphs ⋮ Digraph searching, directed vertex separation and directed pathwidth ⋮ Monotonicity in digraph search problems ⋮ Lower bounds on the pathwidth of some grid-like graphs ⋮ The fast search number of a Cartesian product of graphs ⋮ Cops and robber game without recharging ⋮ Parallel cleaning of a network with brushes ⋮ Cop-win graphs with maximum capture-time ⋮ A graph search algorithm for indoor pursuit/evasion ⋮ Pursuing a fast robber on a graph ⋮ Connected searching of weighted trees ⋮ Safe navigation in adversarial environments ⋮ Chasing robbers on random graphs: Zigzag theorem ⋮ Large classes of infinite k-cop-win graphs ⋮ Meyniel's conjecture holds for random graphs ⋮ Unnamed Item ⋮ A Combinatorial Model of Two-Sided Search ⋮ The fast search number of a complete \(k\)-partite graph ⋮ Vertex Pursuit Games in Stochastic Network Models ⋮ The object detection by autonomous apparatus as a solution of the Buffon needle problem ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Variations of cops and robbers game on grids ⋮ Guarding a subgraph as a tool in pursuit-evasion games ⋮ A witness version of the cops and robber game ⋮ Distributed Evacuation in Graphs with Multiple Exits ⋮ Searching for a Visible, Lazy Fugitive ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ The capture time of a graph ⋮ Sweeping graphs with large clique number ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Digraphs of Bounded Width ⋮ Conjectures on Cops and Robbers ⋮ Zero-visibility cops and robber and the pathwidth of a graph ⋮ The optimal capture time of the one-cop-moves game ⋮ Distributed graph searching with a sense of direction
This page was built for publication:
