论文信息 - On the cop number of toroidal graphs - 字舞流文

On the cop number of toroidal graphs

We show that the cop number of toroidal graphs is at most 3. This resolves a conjecture by Schroeder from 2001 which is implicit in a question by Andreae from 1986.

[1] A. Bonato,et al. Meyniel’s conjecture on the cop number: A survey , 2013, 1308.3385.

[2] Florian Lehner,et al. Bounding the Cop Number of a Graph by Its Genus , 2021, SIAM J. Discret. Math..

[3] Alain Quilliot,et al. A short note about pursuit games played on a graph with a given genus , 1985, J. Comb. Theory, Ser. B.

[4] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[5] Bernd S. W. Schröder. The Copnumber of a Graph is Bounded by [3/2 genus ( G )] + 3 , 2001 .

[6] Thomas Andreae,et al. On a pursuit game played on graphs for which a minor is excluded , 1986, J. Comb. Theory, Ser. B.

[7] Bojan Mohar. Notes on Cops and Robber game on graphs , 2017 .

[8] Anthony Bonato,et al. Topological directions in Cops and Robbers , 2017, ArXiv.

[9] Samuel Fiorini,et al. A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces , 2014, Graphs Comb..

[10] Martin Aigner,et al. A game of cops and robbers , 1984, Discret. Appl. Math..

[11] Anthony Bonato,et al. The Game of Cops and Robbers on Graphs , 2011 .