Hardness results for total rainbow connection of graphs (Q274688)
From MaRDI portal
!
WARNING
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 6572933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results for total rainbow connection of graphs |
scientific article; zbMATH DE number 6572933 |
Statements
Hardness results for total rainbow connection of graphs (English)
0 references
25 April 2016
0 references
total rainbow connection
0 references
computational complexity
0 references
0 references
0.9606866240501404
0 references
0.863203763961792
0 references
0.8516563177108765
0 references
0.8494851589202881
0 references
0.849469780921936
0 references
