Pages that link to "Item:Q3094914"
From MaRDI portal
The following pages link to Cop and Robber Games When the Robber Can Hide and Ride (Q3094914):
Displaying 17 items.
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Pursuit evasion on infinite graphs (Q343924) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- A cop-winning strategy on strongly cop-win graphs (Q6041547) (← links)
- Coarse geometry of the cops and robber game (Q6080533) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- Pursuit-evasion in graphs: zombies, lazy zombies and a survivor (Q6635086) (← links)
