On 1-Planar Graphs with Bounded Cop-Number

TL;DR

This paper investigates the cop-number in 1-planar graphs, showing that under certain embedding conditions, the cop-number is bounded, extending previous results on maximal 1-planar graphs.

Contribution

It establishes bounds on the cop-number for 1-planar graphs with relaxed crossing conditions, generalizing prior work on maximal 1-planar graphs.

Findings

Graphs without $ imes$-crossings have cop-number at most 21.

Graphs with up to $eta$ $ imes$-crossings have cop-number at most $eta + 21.

The cop-number can be bounded based on the number of $ imes$-crossings in the embedding.

Abstract

Cops and Robbers is a type of pursuit-evasion game played on a graph where a set of cops try to capture a single robber. The cops first choose their initial vertex positions, and later the robber chooses a vertex. The cops and robbers make their moves in alternate turns: in the cops' turn, every cop can either choose to move to an adjacent vertex or stay on the same vertex, and likewise the robber in his turn. If the cops can capture the robber in a finite number of rounds, the cops win, otherwise the robber wins. The cop-number of a graph is the minimum number of cops required to catch a robber in the graph. It has long been known that graphs embedded on surfaces (such as planar graphs and toroidal graphs) have a small cop-number. Recently, Durocher et al. [Graph Drawing, 2023] investigated the problem of cop-number for the class of $1$-planar graphs, which are graphs that can be embedded in the plane such that each edge is crossed at most once. They showed that unlike planar graphs which require just three cops, 1-planar graphs have an unbounded cop-number. On the positive side, they showed that maximal 1-planar graphs require only three cops by crucially using the fact that the endpoints of every crossing in an embedded maximal 1-planar graph induce a $K_4$. In this paper, we show that the cop-number remains bounded even under the relaxed condition that the endpoints induce at least three edges. More precisely, let an $\times$-crossing of an embedded 1-planar graph be a crossing whose endpoints induce a matching; i.e., there is no edge connecting the endpoints apart from the crossing edges themselves. We show that any 1-planar graph that can be embedded without $\times$-crossings has cop-number at most 21. Moreover, any 1-planar graph that can be embedded with at most $\gamma$ $\times$-crossings has cop-number at most $\gamma + 21$.