A note on \(k\)-cop-win graphs (Q1699565)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6842977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on \(k\)-cop-win graphs |
scientific article; zbMATH DE number 6842977 |
Statements
A note on \(k\)-cop-win graphs (English)
0 references
23 February 2018
0 references
cops and robbers
0 references
\(k\)-cop-win graphs
0 references
connectivity
0 references
0.9197995
0 references
0.9114914
0 references
0.89952594
0 references
0.88899356
0 references
0 references
0.8701957
0 references
0.8647596
0 references
0.85715586
0 references
