Pages that link to "Item:Q3225131"
From MaRDI portal
The following pages link to A Bound for the Cops and Robbers Problem (Q3225131):
Displaying 28 items.
- To catch a falling robber (Q265090) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- Catching a fast robber on the grid (Q2401986) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← 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 Geometric Graphs (Q3168443) (← links)
- Cops and Robbers on Graphs of Bounded Diameter (Q3300761) (← links)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- Cops and Robbers on Dynamic Graphs: Offline and Online Case (Q5100960) (← links)
- (Q5136239) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- The node cop‐win reliability of unicyclic and bicyclic graphs (Q6065860) (← links)
- On the cop number of graphs of high girth (Q6093134) (← links)
