Containment: A Variation of Cops and Robbers
暂无分享,去创建一个
[1] Xavier Dahan,et al. Regular graphs of large girth and arbitrary degree , 2011, Comb..
[2] Alfred Weiss. Girths of bipartite sextet graphs , 1984, Comb..
[3] Norman Biggs,et al. Constructions for Cubic Graphs with Large Girth , 1998, Electron. J. Comb..
[4] François Laviolette,et al. On cop-win graphs , 2002, Discret. Math..
[5] Linyuan Lu,et al. On Meyniel's conjecture of the cop number , 2012, J. Graph Theory.
[6] Norman Biggs,et al. The sextet construction for cubic graphs , 1983, Comb..
[7] Peter Winkler,et al. Hard constraints and the Bethe Lattice: adventures at the interface of combinatorics and statistical physics , 2002 .
[8] Gary MacGillivray,et al. A note on k-cop, l-robber games on graphs , 2006, Discret. Math..
[9] Henry Meyniel,et al. On a game of policemen and robber , 1987, Discret. Appl. Math..
[10] Pawel Pralat. Containment Game Played on Random Graphs: Another Zig-Zag Theorem , 2015, Electron. J. Comb..
[11] Gary MacGillivray,et al. Characterizations of k-copwin graphs , 2012, Discret. Math..
[12] Anthony Bonato,et al. The capture time of a graph , 2009, Discret. Math..
[13] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..
[14] Martin Aigner,et al. A game of cops and robbers , 1984, Discret. Appl. Math..
[15] B. Intrigila,et al. On the Cop Number of a Graph , 1993 .
[16] Peter Frankl,et al. Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..
[17] Peter Winkler,et al. Maximum itting Time for Random Walks on Graphs , 1990, Random Struct. Algorithms.