Characterizations of \(k\)-copwin graphs

DOI10.1016/j.disc.2012.01.002zbMath1235.91024OpenAlexW2088306445MaRDI QIDQ408176

Nancy E. Clarke, Gary MacGillivray

Publication date: 29 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.002

zbMATH Keywords

cops and robberpursuit game

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (27)

General cops and robbers games with randomness ⋮ Unnamed Item ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ A faster algorithm for cops and robbers ⋮ Containment: a variation of cops and robber ⋮ Limited visibility cops and robber ⋮ Cops and Robbers on Dynamic Graphs: Offline and Online Case ⋮ The complexity of zero-visibility cops and robber ⋮ Almost all cop-win graphs contain a universal vertex ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Cops and robber on subclasses of \(P_5\)-free graphs ⋮ The one-cop-moves game on graphs with some special structures ⋮ A note on the cops and robber game on graphs embedded in non-orientable surfaces ⋮ Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) ⋮ Cops and Robbers on diameter two graphs ⋮ Fine-grained Lower Bounds on Cops and Robbers ⋮ Cops and robbers on \(2K_2\)-free graphs ⋮ Cops and robbers ordinals of cop-win trees ⋮ Cops and robbers is EXPTIME-complete ⋮ Edge critical cops and robber ⋮ Edge-critical cops and robber in planar graphs ⋮ A survey on the relationship between the game of cops and robbers and other game representations ⋮ 4-cop-win graphs have at least 19 vertices ⋮ The one-cop-moves game on planar graphs ⋮ Ambush cops and robbers ⋮ Zero-visibility cops and robber and the pathwidth of a graph ⋮ The optimal capture time of the one-cop-moves game

Cites Work

• Unnamed Item
• Unnamed Item
• Cops and robbers from a distance
• A game of cops and robbers
• On the cop number of a graph
• Bridged graphs are cop-win graphs: An algorithmic proof
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Tandem-win graphs
• On Distance-Preserving and Domination Elimination Orderings
• A Tandem version of the Cops and Robber Game played on products of graphs

This page was built for publication: Characterizations of \(k\)-copwin graphs