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 this page instead for the normal view: The rainbow connection of a graph is (at most) reciprocal to its minimum degree |
scientific article; zbMATH DE number 5681501
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
