The rainbow connection of a graph is (at most) reciprocal to its minimum degree (Q5190328)
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 5681501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The rainbow connection of a graph is (at most) reciprocal to its minimum degree |
scientific article; zbMATH DE number 5681501 |
Statements
The rainbow connection of a graph is (at most) reciprocal to its minimum degree (English)
0 references
15 March 2010
0 references
rainbow connection
0 references
minimum degree
0 references
0.9306533932685852
0 references
0.9146148562431335
0 references
0.9125247001647948
0 references
0.9044484496116638
0 references
0.9042227268218994
0 references
