Pages that link to "Item:Q2433710"

The following pages link to A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710):

Displayed 11 items.

• 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)
• 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)
• Pursuing a fast robber on a graph (Q2268876) ‎ (← links)
• Fast Robber in Planar Graphs (Q5302065) ‎ (← links)