Pages that link to "Item:Q2196569"
From MaRDI portal
The following pages link to A tight lower bound for the capture time of the cops and robbers game (Q2196569):
Displaying 8 items.
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- The localization capture time of a graph (Q2118876) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- (Q3104264) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)