Hardness results for three kinds of colored connections of graphs (Q2202016)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness results for three kinds of colored connections of graphs |
scientific article |
Statements
Hardness results for three kinds of colored connections of graphs (English)
0 references
17 September 2020
0 references
monochromatic connection number
0 references
proper connection number
0 references
conflict-free connection number
0 references
complexity
0 references
NP-hardness
0 references
