Hardness result for the total rainbow \(k\)-connection of graphs (Q1735420)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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