Pages that link to "Item:Q1584265"
From MaRDI portal
The following pages link to A game of cops and robbers played on products of graphs (Q1584265):
Displaying 15 items.
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- The capture time of grids (Q616367) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- The impact of loops on the game of cops and robbers on graphs (Q1712543) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)