Hardness results for three kinds of colored connections of graphs (Q2202016)
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 results for three kinds of colored connections of graphs |
scientific article; zbMATH DE number 7248852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness results for three kinds of colored connections of graphs |
scientific article; zbMATH DE number 7248852 |
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
0.8666912317276001
0 references
0.8478354811668396
0 references
0.8339933753013611
0 references
0.8302170634269714
0 references
