Bounds on the localization number

From MaRDI portal

Revision as of 11:59, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5066905

Jump to:navigation, search

DOI10.1002/jgt.22546zbMath1486.05199arXiv1806.05286OpenAlexW3003472028MaRDI QIDQ5066905

Anthony Bonato, William B. Kinnersley

Publication date: 31 March 2022

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05286

zbMATH Keywords

pursuit-evasion games hypercubes degeneracy outerplanar graphs graph searching localization game

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

Edge and pair queries-random graphs and complexity ⋮ The localization number of designs ⋮ The localization game on Cartesian products ⋮ Reviews ⋮ Localization game for random graphs ⋮ Localization game for random geometric graphs

This page was built for publication: Bounds on the localization number

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5066905&oldid=19557221"