scientific article; zbMATH DE number 7720720

zbMath1517.05043arXiv2008.04896MaRDI QIDQ6165487

Anthony Bonato, Melissa Huggan, Trent G. Marbach

Publication date: 1 August 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

metric dimensionKneser graphsMoore graphspolarity graphslocalization number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (2)

The one-visibility localization game ⋮ The localization game on oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On regular hypergraphs of high girth
• Locating a robber on a graph
• Kneser's conjecture, chromatic number, and homotopy
• An annotated bibliography on guaranteed graph searching
• Eigenvalue bounds for independent sets
• Graphs of diameter two with no 4-circuits
• Localization game on geometric and planar graphs
• A note on the localization number of random graphs: diameter two case
• Locating a robber on a graph via distance queries
• Resolving sets for Johnson and Kneser graphs
• The localization capture time of a graph
• Extremal graph theory for metric dimension and diameter
• A robber locating strategy for trees
• Locating a robber with multiple probes
• Locating a backtracking robber on a tree
• Cops and Robbers on Graphs Based on Designs
• Base size, metric dimension and other invariants of groups and graphs
• On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
• On Graphs that do not Contain a Thomsen Graph
• Polarities in finite projective planes

This page was built for publication: