Cops and robbers on graphs based on designs
From MaRDI portal
Publication:2864796
Recommendations
Cites work
- A game of cops and robbers
- A survey on the existence ofG-Designs
- Eigenvalue bounds for independent sets
- On Graphs that do not Contain a Thomsen Graph
- On Meyniel's conjecture of the cop number
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
- On the number of edges of quadrilateral-free graphs
- Pancyclic BIBD block-intersection graphs
- Some maximal arcs in finite projective planes
- The game of cops and robbers on graphs
- Truncated transversal designs: A new lower bound on the number of idempotent MOLS of side \(n\)
- Vertex-to-vertex pursuit in a graph
- When does a random graph have constant cop number?
Cited in
(17)- scientific article; zbMATH DE number 7232976 (Why is no real title available?)
- The combinatorial game \textsc{Nofil} played on Steiner triple systems
- Cops and Robbers on Planar‐Directed Graphs
- Meyniel extremal families of abelian Cayley graphs
- Comparing the power of cops to zombies in pursuit-evasion games
- Cops and Robbers on Graphs of Bounded Diameter
- The localization number of designs
- Cops and robbers on directed and undirected abelian Cayley graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Independent sets in polarity graphs
- Cops and Robbers on diameter two graphs
- scientific article; zbMATH DE number 7720720 (Why is no real title available?)
- Conjectures on cops and robbers
- Cops and Robbers on String Graphs
- Cops that surround a robber
- The impact of loops on the game of cops and robbers on graphs
- scientific article; zbMATH DE number 5241699 (Why is no real title available?)
This page was built for publication: Cops and robbers on graphs based on designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864796)