On the cop number of toroidal graphs

2019/04/16 by Lehner, Florian · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1904.07946

Abstract

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.

Cited by

• Cop number of partial cubes

Related

• 4-cop-win graphs have at least 19 vertices
• Improved bounds on the cop number when forbidding a minor
• Cops and robbers on oriented toroidal grids
• Cop number of 2K₂-free graphs
• On the cop number of graphs of high girth