A new bound for the cops and robbers problem
暂无分享,去创建一个
[1] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..
[2] Martin Aigner,et al. A game of cops and robbers , 1984, Discret. Appl. Math..
[3] Thomas Andreae,et al. On a pursuit game played on graphs for which a minor is excluded , 1986, J. Comb. Theory, Ser. B.
[4] Peter Frankl,et al. Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..
[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[6] B. Intrigila,et al. On the Cop Number of a Graph , 1993 .
[7] B. Alspach. SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .
[8] E. Chiniforooshan. A better bound for the cop number of general graphs , 2008 .
[9] Volkan Isler,et al. The role of information in the cop-robber game , 2008, Theor. Comput. Sci..
[10] Tomasz Łuczak,et al. Chasing robbers on random graphs: Zigzag theorem , 2010 .
[11] Linyuan Lu,et al. On Meyniel's conjecture of the cop number , 2012, J. Graph Theory.