Edge-critical cops and robber in planar graphs

DOI10.1016/J.DISC.2014.03.006MaRDI QIDQ2017039zbMATH OpenOpenAlexFDO

Authors S. 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

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

Recommendations

• Edge contraction and cop-win critical graphs
• scientific article; zbMATH DE number 6820595
• A game of cops and robbers
• Cops and robbers playing on edges
• Edge critical cops and robber

Cites work

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

Cited in

(6)

• Cops and Robbers on Planar‐Directed Graphs
• Edge critical cops and robber
• scientific article; zbMATH DE number 6820595 (Why is no real title available?)
• Linguistic geometry approach for solving the cops and robber problem in grid environments
• Edge contraction and cop-win critical graphs
• Edge degeneracy: algorithmic and structural results

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017039)