Pages that link to "Item:Q1937358"
From MaRDI portal
The following pages link to Meyniel's conjecture on the cop number: a survey (Q1937358):
Displaying 18 items.
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- On the cop number of toroidal graphs (Q1984519) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Cops that surround a robber (Q2197471) (← links)
- Hyperopic cops and robbers (Q2328865) (← links)
- Catching a fast robber on the grid (Q2401986) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- Lazy Cops and Robbers on Hypercubes (Q5364259) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
