On the complexity of rainbow coloring problems (Q1647834)
From MaRDI portal
(Redirected from Item:Q2798233)
| 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: On the complexity of rainbow coloring problems |
scientific article; zbMATH DE number 6562486
- On the Complexity of Rainbow Coloring Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of rainbow coloring problems |
scientific article; zbMATH DE number 6562486 |
|
Statements
On the complexity of rainbow coloring problems (English)
0 references
On the Complexity of Rainbow Coloring Problems (English)
0 references
27 June 2018
0 references
4 April 2016
0 references
rainbow coloring
0 references
rainbow connection number
0 references
graph algorithms
0 references
treewidth
0 references
0.9952813982963562
0 references
0.8957324624061584
0 references
0.8951756358146667
0 references
0.8884938359260559
0 references