A cop-winning strategy on strongly cop-win graphs (Q6041547): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 06:22, 1 August 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
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