Pursuit evasion on infinite graphs (Q343924): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The capture time of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large classes of infinite k-cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cop and Robber Games When the Robber Can Hide and Ride / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructible graphs, infinite bridged graphs and weakly cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cop-win graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501370 / 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: Retract‐collapsible graphs and invariant subgraph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite bridged graphs and strongly dismantlable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constructible graphs, locally Helly graphs, and convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686039 / rank
 
Normal rank

Latest revision as of 23:57, 12 July 2024

scientific article
Language Label Description Also known as
English
Pursuit evasion on infinite graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references