Chasing robbers on random graphs: Zigzag theorem (Q3061185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.20338 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4256158764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3418339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pursuit-Evasion in Models of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better bound for the cop number of general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops and robbers in graphs with large girth and Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography on guaranteed graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Choice Number of Random Hypergraphs / rank
 
Normal rank

Latest revision as of 13:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Chasing robbers on random graphs: Zigzag theorem
scientific article

    Statements

    Chasing robbers on random graphs: Zigzag theorem (English)
    0 references
    0 references
    0 references
    14 December 2010
    0 references
    random graphs
    0 references
    complex networks
    0 references
    vertex-pursuit games
    0 references
    cops and robbers
    0 references
    domination
    0 references
    adjacency property
    0 references

    Identifiers