Guarding a subgraph as a tool in pursuit-evasion games

DOI10.7151/dmgt.2244zbMath1483.05101OpenAlexW2980952384WikidataQ127019226 ScholiaQ127019226MaRDI QIDQ2062677

Drago Bokal, Janja Jerebic

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2244

zbMATH Keywords

pursuit-evasion gameguardinggraph searchinggraph retractionshadow function

Mathematics Subject Classification ID

Games involving graphs (91A43) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coding theorems (Shannon theory) (94A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The guarding game is E-complete
• Guard games on graphs: keep the intruder out!
• How to guard a graph?
• A game of cops and robbers
• A short note about pursuit games played on a graph with a given genus
• On a pursuit game played on graphs for which a minor is excluded
• List homomorphisms to reflexive graphs
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Complexity of the Cop and Robber Guarding Game
• The Guarding Problem – Complexity and Approximation
• Cop-Robber Guarding Game with Cycle Robber Region
• A better bound for the cop number of general graphs

This page was built for publication: Guarding a subgraph as a tool in pursuit-evasion games