Upper bounds for the total rainbow connection of graphs (Q328717)
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: Upper bounds for the total rainbow connection of graphs |
scientific article; zbMATH DE number 6641538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for the total rainbow connection of graphs |
scientific article; zbMATH DE number 6641538 |
Statements
Upper bounds for the total rainbow connection of graphs (English)
0 references
20 October 2016
0 references
total-colored graph
0 references
total rainbow connection
0 references
minimum degree
0 references
2-step dominating set
0 references
0.9690666
0 references
0.96067977
0 references
0.95537454
0 references
0.94613135
0 references
0 references
0.9426339
0 references
0.9380439
0 references
0.9319208
0 references
