An outerstring graph is the intersection graph of curves lying inside a disk with one endpoint
on the boundary of the disk. We show that an outerstring graph with $ n $ vertices has …

We show that the cop number of directed and undirected Cayley graphs on abelian groups
is in O (n), where n is the number of vertices, by introducing a refined inductive method. With …

Cops and Robber is a well-studied two-player pursuit-evasion game played on a graph,
where a group of cops tries to capture the robber. The\emph {cop number} of a graph is the …

Extension Properties of Graphs and Structures Pavel Klavík The main motivation for graph
drawing and geometric representations is finding ways to visualize graphs efficiently to …

Most structural decomposition methods can be characterized through hypergraph games
that are variations of the Robber and Cops graph game that characterizes the notion of …

We study zombies and survivor, a variant of the game of cops and robber on graphs. In this
variant, the single survivor plays the role of the robber and attempts to escape from the …

Cops and Robber is a well-studied two player pursuit-evasion game played on a graph. In
this game, a set of cops, controlled by the first player, tries to capture the position of a robber …

A strict confluent (SC) graph drawing is a drawing of a graph with vertices as points in the
plane, where vertex adjacencies are represented not by individual curves but rather by …

Cops and Robber is a two-player pursuit-evasion game played on graphs. Here, one player
controls a set of k cops, and the other player controls a single robber. The game starts with k …

A Cop and Drunken Robber (CDR) game is one variation of a famous combinatorial game,
called Cops and Robbers, which has been extensively studied and applied in the area of …