Cops and robbers on 2K_2-free graphs

01/09/2020
by   Jérémie Turcotte, et al.
0

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 TEXT

Please sign up or login with your details

Forgot password? Click here to reset