scientific article; zbMATH DE number 6820595

MaRDI QIDQ4598376zbMATH OpenFDO

Authors Charles Dominic, Łukasz Witkowski, D. M. Cardoso, Marcin Witkowski

Publication date 20 December 2017

zbMATH Keywords

cops and robbersvertex-pursuit games

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) 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

• Cops and robbers in graphs with large girth and Cayley graphs
• Edge-critical cops and robber in planar graphs
• Cops and Robbers on Graphs of Bounded Diameter
• Cops and robber on some families of oriented graphs
• Cops and robber on some families of oriented graphs
• Cops and robbers on \(2K_2\)-free graphs
• Cops and robbers on oriented graphs
• Cops and Robbers on Planar‐Directed Graphs
• Cops and robbers on graphs with a set of forbidden induced subgraphs
• The game of Cops and Robber on circulant graphs

Cited in

(6)

• scientific article; zbMATH DE number 7700570 (Why is no real title available?)
• Cops and robbers playing on edges
• Edge critical cops and robber
• Edge contraction and cop-win critical graphs
• Edge-critical cops and robber in planar graphs
• A note on cops and robbers, independence number, domination number and diameter

This page was built for publication:

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