The one-cop-moves game on planar graphs
From MaRDI portal
Publication:2051905
DOI10.1007/s10878-019-00417-xzbMath1480.91056MaRDI QIDQ2051905
Publication date: 25 November 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00417-x
91A43: Games involving graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lazy cops and robbers played on random graphs and graphs on surfaces
- Characterizations of \(k\)-copwin graphs
- Lazy Cops and Robbers on generalized hypercubes
- A game of cops and robbers
- A short note about pursuit games played on a graph with a given genus
- Vertex-to-vertex pursuit in a graph
- The one-cop-moves game on graphs of small treewidth
- The optimal capture time of the one-cop-moves game
- A Separator Theorem for Planar Graphs
- Best Laid Plans of Lions and Men.
- Cops and Robbers on Planar‐Directed Graphs
- Characterizations and algorithms for generalized Cops and Robbers games
- Lazy Cops and Robbers on Hypercubes
- Conjectures on Cops and Robbers