The one-cop-moves game on graphs with some special structures

DOI10.1016/j.tcs.2020.09.033zbMath1468.91020OpenAlexW3087989324MaRDI QIDQ2210510

Lusheng Wang, Boting Yang

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.09.033

zbMATH Keywords

graphscops and robberspursuit-and-evasion problemone-cop-moves game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Characterizations of \(k\)-copwin graphs
• The complexity of pursuit on a graph
• A game of cops and robbers
• Note on a pursuit game played on graphs
• On a pursuit game on Cayley graphs
• Cops and robbers in graphs with large girth and Cayley graphs
• On a pursuit game played on graphs for which a minor is excluded
• On the cop number of a graph
• A game of cops and robbers played on products of graphs
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• Cops and robbers is EXPTIME-complete
• The optimal capture time of the one-cop-moves game
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• A Bound for the Cops and Robbers Problem
• Graph Classes: A Survey
• The Cops and Robber game on graphs with forbidden (induced) subgraphs
• Lazy Cops and Robbers on Hypercubes

This page was built for publication: The one-cop-moves game on graphs with some special structures