Primal-Dual Cops and Robber

01/13/2023
by   Minh Tuan Ha, et al.
0

Cops and Robber is a family of two-player games played on graphs in which one player controls a number of cops and the other player controls a robber. In alternating turns, each player moves (all) his/her figures. The cops try to capture the robber while the latter tries to flee indefinitely. In this paper we consider a variant of the game played on a planar graph where the robber moves between adjacent vertices while the cops move between adjacent faces. The cops capture the robber if they occupy all incident faces. We prove that a constant number of cops suffices to capture the robber on any planar graph of maximum degree Δ if and only if Δ≤ 4.

READ FULL TEXT
research
02/21/2023

Cops and Robber – When Capturing is not Surrounding

We consider "surrounding" versions of the classic Cops and Robber game. ...
research
07/02/2023

Cops and robber on variants of retracts and subdivisions of oriented graphs

Cops and Robber is one of the most studied two-player pursuit-evasion ga...
research
02/19/2018

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given an...
research
07/20/2017

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Pebble games are single-player games on DAGs involving placing and movin...
research
03/26/2020

On Structural Parameterizations of Node Kayles

Node Kayles is a well-known two-player impartial game on graphs: Given a...
research
09/02/2021

Rendezvous on the Line with Different Speeds and Markers that can be Dropped at Chosen Time

In this paper we introduce a Linear Program (LP) based formulation of a ...
research
04/01/2020

Tipsy cop and drunken robber: a variant of the cop and robber game on graphs

Motivated by a biological scenario illustrated in the YouTube video < ht...

Please sign up or login with your details

Forgot password? Click here to reset