Pages that link to "Item:Q968433"

The following pages link to Cop-win graphs with maximum capture-time (Q968433):

Displaying 16 items.

• Simultaneously moving cops and robbers (Q306253) (← links)
• The capture time of grids (Q616367) (← 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)
• The impact of loops on the game of cops and robbers on graphs (Q1712543) (← links)
• The capture time of the hypercube (Q1953506) (← links)
• Capture-time extremal cop-win graphs (Q2042606) (← links)
• A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I (Q2069711) (← links)
• Capture times in the bridge-burning cops and robbers game (Q2142681) (← links)
• The optimal capture time of the one-cop-moves game (Q2348264) (← links)
• The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
• Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
• The damage throttling number of a graph (Q5000318) (← links)
• Game with Slow Pursuers on the Edge Graphs of Regular Simplexes (Q5057950) (← links)
• Differential Game with Slow Pursuers on the Edge Graph of a Simplex (Q5072237) (← links)
• (Q5206905) (← links)