Cop-win graph

Known as: Bridged graph, Dismantlable graph

In graph theory, a cop-win graph is an undirected graph on which the pursuer (cop) can always win a pursuit-evasion game in which he chases a robber…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this…

2015

The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ where the game is played with perfect information…

2014

Let G be a finite connected graph of order at least two. Two players (a cop and a robber) are allowed to play a game on G…

2012

Cops and Robbers is a two-player pursuit game played on an undirected, reflexive graph G. Player 1 controls k cops who begin on…

2010

Retractable complexes are defined in this paper. It is proved that they have the fixed simplex property for simplicial maps. This…

2010

2007

Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p…

2004

2003

A graph G is bridged if every cycle C of length at least 4 has vertices x,y such that dG(x,y) < dC(x,y). A cycle C is isometric…

2001

A graph (I’ is bridged if it contains no isometric cycles of length greater than 3. For each positive integer p, let Tp be the…