  We prove that the cop number of any $2K_2$-free graph is at most 2, proving a
conjecture of Sivaraman and Testa. We also show that the upper bound of $3$ on
the cop number of $2K_1+K_2$-free (co-diamond--free) graphs is best possible.
