The one-cop-moves game on planar graphs

DOI10.1007/s10878-019-00417-xzbMath1480.91056OpenAlexW2946333614MaRDI QIDQ2051905

Boting Yang, Ziyuan Gao

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

zbMATH Keywords

planar graphscops and robberslazy cops and robbers gameone-cop-moves game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (1)

A simple method for proving lower bounds in the zero-visibility cops and robber game

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

This page was built for publication: The one-cop-moves game on planar graphs