Pages that link to "Item:Q2348264"

The following pages link to The optimal capture time of the one-cop-moves game (Q2348264):

Displaying 7 items.

• Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
• The one-cop-moves game on planar graphs (Q2051905) (← links)
• Capture times in the bridge-burning cops and robbers game (Q2142681) (← links)
• A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
• Cops and robbers on graphs with a set of forbidden induced subgraphs (Q2196576) (← links)
• The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
• Guarding isometric subgraphs and cops and robber in planar graphs (Q6563993) (← links)