Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. A game of cops and robbers;Aigner;Discrete Appl. Math.,1984
2. Note on a pursuit game played on graphs;Andreae;Discrete Appl. Math.,1984
3. Some remarks on interval graphs;Halin;Combinatorica,1982
4. The complexity of searching a graph (preliminary version);Megiddo,1981
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor;Discrete Mathematics;2025-01
2. Catching a robber on a random k-uniform hypergraph;Canadian Journal of Mathematics;2024-04-01
3. Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs;SIAM Journal on Discrete Mathematics;2024-02-26
4. Cop number of random k-uniform hypergraphs;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. On the cop number of graphs of high girth;Journal of Graph Theory;2022-06-28