Pages that link to "Item:Q2433710"
From MaRDI portal
The following pages link to A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710):
Displaying 25 items.
- A game theoretic analysis of the cops and robber game (Q258742) (← links)
- Cop vs. gambler (Q267177) (← links)
- Simultaneously moving cops and robbers (Q306253) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Selfish cops and passive robber: qualitative games (Q529065) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- The capture time of grids (Q616367) (← 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)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Cop-win graphs with maximum capture-time (Q968433) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- The capture time of a graph (Q1045043) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Some game-theoretic remarks on two-player generalized cops and robbers games (Q2068910) (← links)
- Product throttling (Q2073191) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
