Edge-critical cops and robber in planar graphs

DOI10.1016/j.disc.2014.03.006zbMath1295.05154OpenAlexW2081625090MaRDI QIDQ2017039

Shannon L. Fitzpatrick

Publication date: 25 June 2014

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

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

zbMATH Keywords

planar graphcops and robberpursuit gameedge-critical

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Linguistic geometry approach for solving the cops and robber problem in grid environments

Cites Work

• Characterizations of \(k\)-copwin graphs
• Edge critical cops and robber
• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph

This page was built for publication: Edge-critical cops and robber in planar graphs