Weak and strong \(k\)-connectivity games (Q2509746)
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 6322804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Weak and strong \(k\)-connectivity games |
scientific article; zbMATH DE number 6322804 |
Statements
Weak and strong \(k\)-connectivity games (English)
0 references
29 July 2014
0 references
maker-breaker games
0 references
Hamilton cycle
0 references
perfect matching
0 references
\(k\)-connected graph
0 references
0.8269546627998352
0 references
0.8089006543159485
0 references
0.8081721663475037
0 references
0.8003135919570923
0 references
