Anthony Bonato, N. E. Clarke, S. Finbow, S. Fitzpatrick, M. E. Messinger
Published 2013-08-13Version 1
In this short note, we supply a new upper bound on the cop number in terms of tree decompositions. Our results in some cases extend a previously derived bound on the cop number using treewidth.
Sets with no solutions to $x+y=3z$
Cop number of graphs without long holes
Cops and Robbers on diameter two graphs
![QR code for arXiv:1308.2839 [math.CO]](http://oss.arxitics.com/images/favicon.svg)