On Cops and Robbers on $G^{\Xi}$ and cop-edge critical graphs

@article{Cardoso2017OnCA,
  title={On Cops and Robbers on \$G^\{\Xi\}\$ and cop-edge critical graphs},
  author={Domingos Moreira Cardoso and Charles Dominic and Lukas T. Witkowski and Marcin Witkowski},
  journal={Contributions Discret. Math.},
  year={2017},
  volume={12}
}
Cop Robber game is a two player game played on an  undirected graph. In this game cops try to capture a robber moving on the vertices of the graph. The cop number of a graph is the least number of cops needed to guarantee that the robber will be caught. In this paper we presents results concerning games on $G^{\Xi}$, that is the graph obtained by connecting the corresponding vertices in $G$ and its complement $\overline{G}$. In particular we show that for planar graphs $c(G^{\Xi})\leq 3… 

Figures from this paper

References

SHOWING 1-10 OF 19 REFERENCES

A game of cops and robbers

Edge-critical cops and robber in planar graphs

Cops and robbers on graphs and hypergraphs

Cops and Robbers is a vertex-pursuit game played on a graph where a set of cops attempts to capture a robber. Meyniel's Conjecture gives as asymptotic upper bound on the cop number, the number of

When does a random graph have constant cop number?

Asymptotic results for the game of Cops and Robbers played on a random graph G(n, p) focusing on the case when the cop number does not grow with the size of a graph are presented.

Cops and Robbers on diameter two graphs

Vertex-to-vertex pursuit in a graph

The Game of Cops and Robbers on Graphs

One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games.

ON THE MINIMUM ORDER OF kCOP-WIN GRAPHS

We consider the minimum order graphs with a given cop number. We prove that the minimum order of a connected graph with cop number 3 is 10, and show that the Petersen graph is the unique isomorphism

Domination numbers of planar graphs

The problem of determining the domination number of a graph is a well known NP-hard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we