Cops and robbers in graphs with large girth and Cayley graphs

From MaRDI portal
Publication:1092060

DOI10.1016/0166-218X(87)90033-3zbMath0624.05041OpenAlexW2015309545MaRDI QIDQ1092060

Peter Frankl

Publication date: 1987

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90033-3




Related Items (58)

To catch a falling robberVariations on cops and robbersCops and Robbers on Geometric GraphsOn a pursuit game on Cayley graphsSubdivisions in the robber locating gameFast Robber in Planar GraphsOn Meyniel's conjecture of the cop numberLower Bounds for the Capture Time: Linear, Quadratic, and BeyondThe game of cops and robbers on directed graphs with forbidden subgraphsA faster algorithm for cops and robbersOn the cop number of generalized Petersen graphsThe damage throttling number of a graphContainment: a variation of cops and robberCops and robbers from a distanceChasing a Fast Robber on Planar Graphs and Random GraphsAn evasion game on a graphAn Introduction to Lazy Cops and Robbers on GraphsLocating a robber with multiple probesSome remarks on cops and drunk robbersCops and Robber game with a fast robber on expander graphs and random graphsCops and Robbers on Dynamic Graphs: Offline and Online CaseOn a characterization of evasion strategies for pursuit-evasion games on graphsMeyniel's conjecture on graphs of bounded degreeOn the cop number of graphs of high girthSmarter Lions: Efficient Cooperative Pursuit in General Bounded ArenasA tight lower bound for the capture time of the cops and robbers gameCops that surround a robberSketchy tweets: ten minute conjectures in graph theoryThe localization number of designsTo satisfy impatient web surfers is hardCops and robber on subclasses of \(P_5\)-free graphsThe one-cop-moves game on graphs with some special structuresAn annotated bibliography on guaranteed graph searchingThe fast robber on interval and chordal graphsCops and Robbers on diameter two graphs\(k\)-chordal graphs: from cops and robber to compact routing via treewidthFine-grained Lower Bounds on Cops and RobbersThe complexity of pursuit on a graphThe robber locating gameSome pursuit-evasion problems on gridsLazy Cops and Robbers on generalized hypercubesMost Generalized Petersen graphs of girth 8 have cop number 4Pursuing a fast robber on a graphA proof of the Meyniel conjecture for abelian Cayley graphsA survey on the relationship between the game of cops and robbers and other game representationsThrottling for the game of cops and robbers on graphsChasing robbers on random graphs: Zigzag theoremLower Bounds for the Cop Number when the Robber is FastMeyniel's conjecture holds for random graphs4-cop-win graphs have at least 19 verticesGreedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problemsChasing robbers on random geometric graphs-an alternative approachCops and robbers on directed and undirected abelian Cayley graphsHyperopic cops and robbersThe role of quantum correlations in cop and robber gameA game of cops and robbers played on products of graphsConjectures on Cops and RobbersMeyniel extremal families of abelian Cayley graphs



Cites Work




This page was built for publication: Cops and robbers in graphs with large girth and Cayley graphs