Date:
Thu, 20/04/202317:15-19:00
Location:
Zoom
Zoom Link: https://ucph-ku.zoom.us/j/69937085835
Password: 123456
Title: WhenSurrounding is not Catching in Cops and Robber
Abstract: After a short introduction of theclassical game of Cops and Robber on graphs, we shall discuss two recentlyintroduced variants in which the robber only loses when he is completelysurrounded by the cops. In the first variant the robber is surrounded when hesits at a vertex v and there is at least one cop on each neighbor of v. In thesecond variant cops occupy edges of the graph and the robber (still moving onvertices) is surrounded if he sits at a vertex v and there is at least one copon each incident edge at v. We shall compare these games with each other andalso with the classical game in which the robber is already caught when one copsits on the same vertex as the robber.
Password: 123456
Title: WhenSurrounding is not Catching in Cops and Robber
Abstract: After a short introduction of theclassical game of Cops and Robber on graphs, we shall discuss two recentlyintroduced variants in which the robber only loses when he is completelysurrounded by the cops. In the first variant the robber is surrounded when hesits at a vertex v and there is at least one cop on each neighbor of v. In thesecond variant cops occupy edges of the graph and the robber (still moving onvertices) is surrounded if he sits at a vertex v and there is at least one copon each incident edge at v. We shall compare these games with each other andalso with the classical game in which the robber is already caught when one copsits on the same vertex as the robber.