Pages that link to "Item:Q3061185"
From MaRDI portal
The following pages link to Chasing robbers on random graphs: Zigzag theorem (Q3061185):
Displaying 25 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 on diameter two graphs (Q482211) (← links)
- The robber locating game (Q501037) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← 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)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← 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)
- Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs (Q2431088) (← links)
- Subdivisions in the robber locating game (Q2629293) (← 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 a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Revolutionaries and Spies on Random Graphs (Q4921570) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Counting extensions revisited (Q6074702) (← links)
- Meyniel's conjecture on graphs of bounded degree (Q6080854) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
