arXiv Analytics

Sign in

arXiv:2001.03124 [math.CO]AbstractReferencesReviewsResources

Cops and robbers on $2K_2$-free graphs

Jérémie Turcotte

Published 2020-01-09Version 1

We prove that the cop number of any $2K_2$-free graph is at most 2, which was previously conjectured by Sivaraman and Testa.

Categories: math.CO, cs.DM
Subjects: 05C57, 05C75, 05C38, 91A43
Related articles: Most relevant | Search more
arXiv:2301.13175 [math.CO] (Published 2023-01-30)
Cops and robbers on $P_5$-free graphs
arXiv:1903.11484 [math.CO] (Published 2019-03-27)
Cop number of $2K_2$-free graphs
arXiv:1908.11478 [math.CO] (Published 2019-08-29)
The Cop Number of Graphs with Forbidden Induced Subgraphs

Links

Toolbox