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. (c) 2021 Elsevier B.V. All rights reserved.