Pages that link to "Item:Q724868"

The following pages link to Bounds on the length of a game of cops and robbers (Q724868):

Displaying 21 items.

• Simultaneously moving cops and robbers (Q306253) (← links)
• Jumping robbers in digraphs (Q343927) (← links)
• Cops and Robbers on diameter two graphs (Q482211) (← links)
• A cops and robber game in multidimensional grids (Q602750) (← links)
• The capture time of grids (Q616367) (← links)
• Throttling for the game of cops and robbers on graphs (Q724850) (← links)
• Cop-win graphs with maximum capture-time (Q968433) (← links)
• The capture time of a graph (Q1045043) (← links)
• The capture time of the hypercube (Q1953506) (← links)
• Capture-time extremal cop-win graphs (Q2042606) (← links)
• Optimizing the trade-off between number of cops and capture time in cops and robbers (Q2073651) (← links)
• The localization capture time of a graph (Q2118876) (← links)
• Capture times in the bridge-burning cops and robbers game (Q2142681) (← links)
• A faster algorithm for cops and robbers (Q2166209) (← links)
• A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
• The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
• Variations on cops and robbers (Q2891049) (← links)
• (Q3305770) (← links)
• Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
• Cops and robber on some families of oriented graphs (Q5896831) (← links)
• A cops and robber game and the meeting time of synchronous directed walks (Q6599064) (← links)