Cops and robbers on 2K_2-free graphs
We prove that the cop number of any 2K_2-free graph is at most 2, which was previously conjectured by Sivaraman and Testa.
READ FULL TEXTWe prove that the cop number of any 2K_2-free graph is at most 2, which was previously conjectured by Sivaraman and Testa.
READ FULL TEXT