Searching for an intruder on graphs and their subdivisions
From MaRDI portal
Publication:2153405
DOI10.37236/10577zbMath1492.05099arXiv2104.01739OpenAlexW3145271530MaRDI QIDQ2153405
Publication date: 4 July 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.01739
Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
The one-visibility localization game ⋮ How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
Cites Work
- An evasion game on a graph
- How to hunt an invisible rabbit on a graph
- The complexity of zero-visibility cops and robber
- An annotated bibliography on guaranteed graph searching
- Sweeping graphs with large clique number
- How many lions are needed to clear a grid?
- Finding a princess in a palace: a pursuit-evasion problem
- Topology of series-parallel networks
- Lower bounds on the pathwidth of some grid-like graphs
- Monotonicity in graph searching
- Recontamination does not help to search a graph
- A Combinatorial Model of Two-Sided Search
- Unnamed Item
- Unnamed Item
This page was built for publication: Searching for an intruder on graphs and their subdivisions
