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`

.

##
###
Fast Robber in Planar Graphs
[chapter]

2008
*
Lecture Notes in Computer Science
*

In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in minimizing the number of cops used to capture the robber in a graph. This minimum number is called the cop-number of the graph. If the cops and the robber have the same velocity, 3 + 3 2 g cops are

doi:10.1007/978-3-540-92248-3_28
fatcat:vc6l4jdacfe67b7anhlnu4zjwe