AI Chat AI Image Generator AI Video Text to Speech

Cop number of graphs without long holes

12/30/2019

∙

by Vaidy Sivaraman, et al.

∙

∙

A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t-3 cops to capture a robber in the game of cops and robbers played in a graph that does not contain a hole of length at least t. This strengthens a theorem of Joret-Kaminski-Theis, who proved that t-2 cops have a winning strategy in such graphs. As a consequence of our bound, we also give an inequality relating the cop number and the Dilworth number of a graph.

page 1

page 2

page 3

page 4

research

∙ 03/27/2019

Cop number of 2K_2-free graphs

We prove that the cop number of a 2K_2-free graph is at most 2 if it has...

0 Vaidy Sivaraman, et al. ∙

research

∙ 09/01/2022

Minimally tough chordal graphs with toughness at most 1/2

Let t be a positive real number. A graph is called t-tough if the remova...

0 Gyula Y Katona, et al. ∙

research

∙ 08/23/2017

Limited Visibility Cops and Robbers

We consider a variation of the Cops and Robber game where the cops can o...

0 N. E. Clarke, et al. ∙

research

∙ 11/02/2021

Game of Life on Graphs

We consider a specific graph dynamical system inspired by the famous Con...

0 Mikhail Krechetov, et al. ∙

research

∙ 07/05/2023

Locating Robber with Cop Strategy Graph: Subdivision vs. Multiple Cop

We consider the Robber Locating Game, where an invisible moving robber t...

0 Shiqi Pan, et al. ∙

research

∙ 08/19/2019

A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity

This paper considers a game in which a single cop and a single robber ta...

0 Thomas Erlebach, et al. ∙

research

∙ 06/08/2023

Colouring planar graphs with a precoloured induced cycle

Let C be a cycle and f : V(C) →{c_1,c_2,…,c_k} a proper k-colouring of C...

0 Ajit Diwan, et al. ∙