The following pages link to On the cop number of a graph (Q1325748):
Displaying 22 items.
- Cop vs. gambler (Q267177) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- The capture time of a graph (Q1045043) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- A note on hyperopic cops and robber (Q6174757) (← links)
- Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs (Q6195949) (← links)
