A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Cops and Robbers on Intersection Graphs
[chapter]
2013
Lecture Notes in Computer Science
The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph G, one controlling k cops and the other one robber, all positioned on VG. The players alternate in moving their pieces to distance at most 1 each. The cops win if they capture the robber, the robber wins by escaping indefinitely. The copnumber of G, that is the smallest k such that k cops win the game, has recently been a widely studied parameter. Intersection graph classes are defined
doi:10.1007/978-3-642-45030-3_17
fatcat:k7ojs6vguvhslmropbob6iwnna