4-cop-win graphs have at least 19 vertices

06/04/2020
by   Jérémie Turcotte, et al.
0

We show that the cop number of any graph on 18 or fewer vertices is at most 3. This answers a specific case of a question posed by Baird et al. on the minimum order of 4-cop-win graphs, first appearing in 2011. We also find all 3-cop-win graphs on 11 vertices, narrow down the possible 4-cop-win graphs on 19 vertices and get some progress on finding the minimum order of 3-cop-win planar graphs.

READ FULL TEXT
research
10/03/2019

A note on 1-planar graphs with minimum degree 7

It is well-known that 1-planar graphs have minimum degree at most 7, and...
research
11/06/2022

Cyclability, Connectivity and Circumference

In a graph G, a subset of vertices S ⊆ V(G) is said to be cyclable if th...
research
08/31/2021

Graphs with minimum degree-based entropy

The degree-based entropy of a graph is defined as the Shannon entropy ba...
research
02/10/2018

Searching isomorphic graphs

To determine that two given undirected graphs are isomorphic, we constru...
research
11/12/2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations

We prove a bijection between the triangulations of the 3-dimensional cyc...
research
06/19/2020

Graphs with Multiple Sources per Vertex

Several attempts have been made at constructing Abstract Meaning Represe...
research
10/18/2018

Inglenook Shunting Puzzles

An inglenook puzzle is a classic shunting (switching) puzzle often found...

Please sign up or login with your details

Forgot password? Click here to reset