Intrinsically \(n\)-linked complete graphs (Q841443)
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 5604239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intrinsically \(n\)-linked complete graphs |
scientific article; zbMATH DE number 5604239 |
Statements
Intrinsically \(n\)-linked complete graphs (English)
0 references
16 September 2009
0 references
0.8861736059188843
0 references
0.8755404353141785
0 references
0.8699239492416382
0 references
0.8699239492416382
0 references
0.8559589982032776
0 references
