Algorithms and bounds for very strong rainbow coloring (Q2294720)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7166229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and bounds for very strong rainbow coloring |
scientific article; zbMATH DE number 7166229 |
Statements
Algorithms and bounds for very strong rainbow coloring (English)
0 references
12 February 2020
0 references
graphs of bounded treewidth
0 references
very strong rainbow connection number
0 references
0.8324594497680664
0 references
0.8184115290641785
0 references
0.810108482837677
0 references
