Pages that link to "Item:Q5387056"
From MaRDI portal
The following pages link to A better bound for the cop number of general graphs (Q5387056):
Displaying 12 items.
- Cops and robbers from a distance (Q604465) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- On Meyniel's conjecture of the cop number (Q2911063) (← links)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
