On the conjecture of the smallest 3-cop-win planar graph (Q2988846)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the conjecture of the smallest 3-cop-win planar graph |
scientific article; zbMATH DE number 6721540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the conjecture of the smallest 3-cop-win planar graph |
scientific article; zbMATH DE number 6721540 |
Statements
On the Conjecture of the Smallest 3-Cop-Win Planar Graph (English)
0 references
19 May 2017
0 references
cops and robbers game
0 references
cop number
0 references
capture strategy
0 references
winning vertices
0 references
0.8424709439277649
0 references
0.8268616199493408
0 references
0.8130053281784058
0 references
0.8107295036315918
0 references
0.8053205609321594
0 references
