A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On bridged graphs and cop-win graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5460876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a pursuit game on Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of pursuit on a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On cop-win graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a pursuit game on Cayley digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4881856 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-to-vertex pursuit in a graph / rank | |||
Normal rank |
Revision as of 22:25, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on \(k\)-cop, \(l\)-robber games on graphs |
scientific article |
Statements
A note on \(k\)-cop, \(l\)-robber games on graphs (English)
0 references
30 October 2006
0 references
pursuit
0 references
cop-win
0 references
copnumber
0 references
\(k\)-cop-win
0 references
graph
0 references
digraph
0 references