Abstract
We adapt the Gyárfás path argument to prove that t−2 cops can capture a robber, in at most t−1 moves, in the game of Cops and Robbers played in a graph that does not contain the t-vertex path as an induced subgraph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
