Runner locating with multiple probes

MaRDI QIDQ6858813zbMATH OpenFDO

Authors Kola Akinrele, Axel Brandt, Elizabeth Breen, Catherine Erbes, Matthew Lee, Patrick O'Doherty, Weston Rainer

Publication date 12 February 2026

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/93/ajc_v93_p318.pdf

zbMATH Keywords

cops and robbers on a graph

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites work

• A robber locating strategy for trees
• Centroidal localization game
• Graphs with metric dimension two - a characterization
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Localization game on geometric and planar graphs
• Locating a robber on a graph
• Locating a robber on a graph via distance queries
• Locating a robber with multiple probes
• On the Metric Dimension of Cartesian Products of Graphs
• Resolvability in graphs and the metric dimension of a graph
• Sequential metric dimension
• Subdivisions in the robber locating game
• The localization capture time of a graph
• The localization game on Cartesian products
• The metric dimension of Cartesian products of graphs
• The metric dimensions of a complete \(n\)-partite graph and its Cartesian product with a path
• The robber locating game

This page was built for publication: Runner locating with multiple probes

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