A cop-winning strategy on strongly cop-win graphs (Q6041547): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2023.113419 / 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: A witness version of the cops and robber game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Pursuit-Evasion with Local Visibility / 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: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2023.113419 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 30 December 2024

scientific article; zbMATH DE number 7690007
Language Label Description Also known as
English
A cop-winning strategy on strongly cop-win graphs
scientific article; zbMATH DE number 7690007

    Statements

    A cop-winning strategy on strongly cop-win graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2023
    0 references
    strongly cop-win graph
    0 references
    cop-win
    0 references
    strategy
    0 references
    dismantling order
    0 references
    fast robber
    0 references

    Identifiers