Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500)
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 6333604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight upper bound of the rainbow vertex-connection number for 2-connected graphs |
scientific article; zbMATH DE number 6333604 |
Statements
Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (English)
0 references
22 August 2014
0 references
rainbow vertex coloring
0 references
rainbow vertex-connection number
0 references
ear decomposition
0 references
2-connected graph
0 references
0.8625273704528809
0 references
0.8570640683174133
0 references
0.8551477789878845
0 references
0.8535851836204529
0 references
0.8475238680839539
0 references
