The localization capture time of a graph
From MaRDI portal
Publication:2118876
Recommendations
Cites work
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- A note on the localization number of random graphs: diameter two case
- A robber locating strategy for trees
- A tight lower bound for the capture time of the cops and robbers game
- An annotated bibliography on guaranteed graph searching
- Bounds on the length of a game of cops and robbers
- Centroidal localization game
- Graph Classes: A Survey
- Localization game for random graphs
- Localization game on geometric and planar graphs
- Locating a backtracking robber on a tree
- Locating a robber on a graph
- Locating a robber on a graph via distance queries
- Locating a robber with multiple probes
- Monotonicity in graph searching
- On the cop number of a graph
- Recontamination does not help to search a graph
- The capture time of a graph
- The game of cops and robbers on graphs
- The game of overprescribed Cops and Robbers played on graphs
- The localization game on Cartesian products
Cited in
(6)
This page was built for publication: The localization capture time of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118876)