A solution to a conjecture on two rainbow connection numbers of a graph. (Q4909692)
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: A solution to a conjecture on two rainbow connection numbers of a graph. |
scientific article; zbMATH DE number 6148005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A solution to a conjecture on two rainbow connection numbers of a graph. |
scientific article; zbMATH DE number 6148005 |
Statements
21 March 2013
0 references
edge-colored graph
0 references
(strong) rainbow coloring
0 references
(strong) rainbow connection number
0 references
math.CO
0 references
0.8302602767944336
0 references
0.8225612044334412
0 references
0.8187994956970215
0 references
0.8090595602989197
0 references
0.8084462285041809
0 references
