A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136)
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: A note on the minimum size of k-rainbow-connected graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the minimum size of \(k\)-rainbow-connected graphs |
scientific article |
Statements
A note on the minimum size of \(k\)-rainbow-connected graphs (English)
0 references
8 August 2014
0 references
edge colouring
0 references
rainbow connection
0 references
0.9491952657699584
0 references
0.944511651992798
0 references
0.9362654089927672
0 references
0.8892428874969482
0 references
0.8774266839027405
0 references
