Zombie number of the Cartesian product of graphs
From MaRDI portal
Publication:2217508
Recommendations
- On the zombie number of various graph classes
- Hadwiger number and the Cartesian product of graphs
- Zip product of graphs and crossing numbers
- The Menger number of the Cartesian product of graphs
- scientific article; zbMATH DE number 3954951
- The distinguishing number of Cartesian products of complete graphs
- scientific article; zbMATH DE number 4037592
- The Cartesian product of hypergraphs
- Distinguishing numbers of Cartesian products of multiple complete graphs
- The monophonic number of Cartesian product graphs
Cites work
- A deterministic version of the game of zombies and survivors on graphs
- Comparing the power of cops to zombies in pursuit-evasion games
- Cops and robbers is EXPTIME-complete
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Pursuing a fast robber on a graph
- The capture time of a graph
Cited in
(6)- Comparing the power of cops to zombies in pursuit-evasion games
- A note on deterministic zombies
- How many zombies are needed to catch the survivor on toroidal grids?
- A deterministic version of the game of zombies and survivors on graphs
- A probabilistic version of the game of zombies and survivors on graphs
- On the zombie number of various graph classes
This page was built for publication: Zombie number of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217508)