The following pages link to On cop-win graphs (Q1850039):
Displaying 12 items.
- Cop vs. gambler (Q267177) (← links)
- Pursuit evasion on infinite graphs (Q343924) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- The capture time of a graph (Q1045043) (← links)
- A Helly theorem for geodesic convexity in strongly dismantlable graphs (Q1893169) (← links)
- Constructible graphs and pursuit (Q2166777) (← links)
- Containment: a variation of cops and robber (Q2175792) (← links)
- Limited visibility cops and robber (Q2185730) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
