Pages that link to "Item:Q3078593"
From MaRDI portal
The following pages link to Pursuit-Evasion in Models of Complex Networks (Q3078593):
Displayed 18 items.
- To catch a falling robber (Q265090) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The role of quantum correlations in cop and robber game (Q2329935) (← links)
- Containment game played on random graphs: another zig-zag theorem (Q2346471) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)