The one-visibility localization game (Q6073890): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Separator Theorem for Nonplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The localization capture time of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for an intruder on graphs and their subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on isoperimetric values of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressions and isoperimetric inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Invitation to Pursuit-Evasion Games and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6165487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Localization game on geometric and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centroidal localization game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robber locating strategy for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a robber on a graph via distance queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-visibility cops and robber and the pathwidth of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of zero-visibility cops and robber / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the vertex boundary-width of complete \(k\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a robber on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a backtracking robber on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on isoperimetric peaks of complete trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-visibility cops and robber on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-visibility cops and robber on trees: optimal cop-win strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the one-visibility cop-win strategies for trees / rank
 
Normal rank

Revision as of 04:35, 3 August 2024

scientific article; zbMATH DE number 7748739
Language Label Description Also known as
English
The one-visibility localization game
scientific article; zbMATH DE number 7748739

    Statements

    The one-visibility localization game (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2023
    0 references
    localization number
    0 references
    limited visibility
    0 references
    pursuit-evasion games
    0 references
    isoperimetric inequalities
    0 references
    graphs
    0 references

    Identifiers