Pages that link to "Item:Q1072462"
From MaRDI portal
The following pages link to A short note about pursuit games played on a graph with a given genus (Q1072462):
Displayed 40 items.
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Revolutionaries and spies (Q713165) (← links)
- Note on a pursuit game played on graphs (Q799702) (← links)
- How to hunt an invisible rabbit on a graph (Q896060) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- A witness version of the cops and robber game (Q1025953) (← links)
- On a pursuit game played on graphs for which a minor is excluded (Q1101027) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- Chromatic numbers of exact distance graphs (Q1633747) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- On a game of policemen and robber (Q1820799) (← links)
- On the cop number of toroidal graphs (Q1984519) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Some game-theoretic remarks on two-player generalized cops and robbers games (Q2068910) (← links)
- Noise controlling entangling operators in the quantum network implementation of cop and robber game (Q2107965) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) (← links)
- On positionality of trigger strategies Nash equilibria in SCAR (Q2207502) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
- Implementation of sequential game on quantum circuits (Q2677267) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- On Meyniel's conjecture of the cop number (Q2911063) (← links)
- Catching a Fast Robber on Interval Graphs (Q3010416) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- Bounding the Cop Number of a Graph by Its Genus (Q5163511) (← links)
- Fast Robber in Planar Graphs (Q5302065) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5890918) (← links)
- On the generalised colouring numbers of graphs that exclude a fixed minor (Q5920084) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q6116185) (← links)