Cops and robbers on oriented toroidal grids

The game of cops and robbers is a well-known game played on graphs. In this paper we consider the straight-ahead orientations of 4-regular quadrangulations of the torus and the Klein bottle and we prove that their cop number is bounded by a constant. We also show that the cop number of every k-regularly oriented toroidal grid is at most 13.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2021

On Deeply Critical Oriented Cliques

In this work we consider arc criticality in colourings of oriented graph...
research
02/27/2022

Heroes in oriented complete multipartite graphs

The dichromatic number of a digraph is the minimum size of a partition o...
research
02/20/2022

Resolution to Sutner's Conjecture

Consider a game played on a simple graph G = (V,E) where each vertex con...
research
03/08/2020

The Game of Cops and Eternal Robbers

We introduce the game of Cops and Eternal Robbers played on graphs, wher...
research
01/04/2021

Transversal achievement game on a square grid

This paper intends to solve the Transversal achievement on an n times n ...
research
11/15/2018

Cops and robbers on oriented graphs

We consider the well-studied cops and robbers game in the context of ori...
research
05/05/2021

2× n Grids have Unbounded Anagram-Free Chromatic Number

We show that anagram-free vertex colouring a 2× n square grid requires a...

Please sign up or login with your details

Forgot password? Click here to reset