Results 1  10
of
403
A GAME OF COPS AND ROBBERS
, 1984
"... Let G be a finite connected graph. Two players, called cop C and robber R, play a game on G according to the following rules. First C then R occupy some vertex of G. After that they move alternately along edges of G. The cop C wins if he succeeds in putting himself on top of the robber R, otherwise ..."
Abstract

Cited by 124 (0 self)
 Add to MetaCart
Let G be a finite connected graph. Two players, called cop C and robber R, play a game on G according to the following rules. First C then R occupy some vertex of G. After that they move alternately along edges of G. The cop C wins if he succeeds in putting himself on top of the robber R, otherwise
Cops and Robbers on Geometric Graphs
, 2011
"... Cops and robbers is a turnbased pursuit game played on a graph G. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number c(G) denotes the minimum number of cops required to catch the robber in finite time. We study the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Cops and robbers is a turnbased pursuit game played on a graph G. One robber is pursued by a set of cops. In each round, these agents move between vertices along the edges of the graph. The cop number c(G) denotes the minimum number of cops required to catch the robber in finite time. We study
Cops and Robbers on graphs based on designs
 Journal of Combinatorial Designs
"... Abstract: We investigate the cop number of graphs based on combinatorial designs. Incidence graphs, point graphs, and block intersection graphs are studied, with an emphasis on finding families of graphs with large cop number. We generalize known results on Meyniel extremal families by supplying bou ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Abstract: We investigate the cop number of graphs based on combinatorial designs. Incidence graphs, point graphs, and block intersection graphs are studied, with an emphasis on finding families of graphs with large cop number. We generalize known results on Meyniel extremal families by supplying
The game of Wall Cops and Robbers⋆
"... Abstract. Wall Cops and Robbers is a new vertex pursuit game played on graphs, inspired by both the games of Cops and Robbers and Conway’s Angel Problem. In the game, the cops are free to move to any vertex and build a wall; once a vertex contains a wall, the robber may not move there. Otherwise, th ..."
Abstract
 Add to MetaCart
Abstract. Wall Cops and Robbers is a new vertex pursuit game played on graphs, inspired by both the games of Cops and Robbers and Conway’s Angel Problem. In the game, the cops are free to move to any vertex and build a wall; once a vertex contains a wall, the robber may not move there. Otherwise
Bounds for Cops and Robber Pursuit
, 2009
"... Abstract. We prove that the robber can evade (that is, stay at least unit distance from) at least ⌊n/5.889 ⌋ cops patroling an n × n continuous square region, that a robber can always evade a single cop patroling a square with side length 4 or larger, and that a single cop on patrol can always captu ..."
Abstract
 Add to MetaCart
Abstract. We prove that the robber can evade (that is, stay at least unit distance from) at least ⌊n/5.889 ⌋ cops patroling an n × n continuous square region, that a robber can always evade a single cop patroling a square with side length 4 or larger, and that a single cop on patrol can always
Cops and robber game with a fast robber
, 2011
"... I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Graph searching problems are described as games played ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
that the cop number (the minimum number of cops that can always capture the robber) of a connected graph on n vertices is O( n). We consider a version of the Cops and Robber game, where the robber is faster than the cops, but is not allowed to jump over the cops. This version was first studied in 2008. We show
Fast robber in planar graphs
, 2008
"... In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists in m ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
In the cops and robber game, two players play alternately by moving their tokens along the edges of a graph. The first one plays with the cops and the second one with one robber. The cops aim at capturing the robber, while the robber tries to infinitely evade the cops. The main problem consists
CATCH ME IF YOU CAN: COPS AND ROBBERS ON GRAPHS
"... Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts to capture a robber. The cop number is the minimum number of cops needed to win. While cop number of a gra ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts to capture a robber. The cop number is the minimum number of cops needed to win. While cop number of a
Cops and robbers from a distance
 Theor. Comput. Sci
"... Abstract. Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where the cops win if at least one of them is of distance at most k from the robber in G. The cop number of a graph G ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where the cops win if at least one of them is of distance at most k from the robber in G. The cop number of a graph
Results 1  10
of
403