Pages that link to "Item:Q2795750"
From MaRDI portal
The following pages link to Meyniel's conjecture holds for random graphs (Q2795750):
Displaying 16 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)
- 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)
- 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)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- Meyniel's conjecture on graphs of bounded degree (Q6080854) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
- Linear colouring of binomial random graphs (Q6646401) (← links)
