Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420)
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: Hardness result for the total rainbow k-connection of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness result for the total rainbow \(k\)-connection of graphs |
scientific article |
Statements
Hardness result for the total rainbow \(k\)-connection of graphs (English)
0 references
28 March 2019
0 references
total-rainbow \(k\)-connection number
0 references
computational complexity
0 references
NP-complete
0 references
0.9606866240501404
0 references
0.8906388282775879
0 references
0.8861908316612244
0 references
0.883602499961853
0 references
0.8671503067016602
0 references
