Smallest \(k\)-rainbow connected graphs for large \(k\) (Q2869375)
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: Smallest k-rainbow connected graphs for large k |
scientific article; zbMATH DE number 6242645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smallest \(k\)-rainbow connected graphs for large \(k\) |
scientific article; zbMATH DE number 6242645 |
Statements
3 January 2014
0 references
Smallest \(k\)-rainbow connected graphs for large \(k\) (English)
0 references
0.9395888447761536
0 references
0.938238263130188
0 references
0.9362654089927672
0 references
0.903222918510437
0 references
0.886784017086029
0 references
