Localization game capture time of trees and outerplanar graphs

DOI10.1016/J.TCS.2026.116123MaRDI QIDQ7319268zbMATH OpenFDO

Authors Vesna Iršič Chenoweth, Matija Skrt

Publication date 25 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116123

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A robber locating strategy for trees
• A tight lower bound for the capture time of the cops and robbers game
• An invitation to pursuit-evasion games and graph theory
• Bounds on the length of a game of cops and robbers
• Bounds on the localization number
• Centroidal localization game
• scientific article; zbMATH DE number 7720720 (Why is no real title available?)
• 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
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• The capture time of a graph
• The game of cops and robbers on graphs
• The localization capture time of a graph
• The localization game on Cartesian products
• The localization number of designs

This page was built for publication: Localization game capture time of trees and outerplanar graphs

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