2 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 2 cited
Meyniel's conjecture on the cop number: a survey
William Baird, Anthony Bonato
Meyniel's conjecture is one of the deepest open problems on the cop number of a graph. It states that for a connected graph of order While largely ig…
math.CO2013★ 2 cited
On the minimum order of k-cop-win graphs
William Baird, Andrew Beveridge, Anthony Bonato +4
We consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the…