Pages that link to "Item:Q1092060"
From MaRDI portal
The following pages link to Cops and robbers in graphs with large girth and Cayley graphs (Q1092060):
Displaying 50 items.
- To catch a falling robber (Q265090) (← links)
- An evasion game on a graph (Q383337) (← 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)
- The robber locating game (Q501037) (← links)
- Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- On a pursuit game on Cayley graphs (Q1090336) (← links)
- On a pursuit game on Cayley digraphs (Q1100216) (← links)
- Some pursuit-evasion problems on grids (Q1199947) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← 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)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- A note on cops and robbers, independence number, domination number and diameter (Q2092403) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) (← links)
- A faster algorithm for cops and robbers (Q2166209) (← links)
- Containment: a variation of cops and robber (Q2175792) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Cops that surround a robber (Q2197471) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Hyperopic cops and robbers (Q2328865) (← links)
- The role of quantum correlations in cop and robber game (Q2329935) (← links)
- On the cop number of generalized Petersen graphs (Q2400572) (← links)
- Locating a robber with multiple probes (Q2411615) (← links)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Subdivisions in the robber locating game (Q2629293) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← 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)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← 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)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
