A sharp upper bound for the rainbow 2-connection number of a 2-connected graph (Q1942665)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sharp upper bound for the rainbow 2-connection number of a 2-connected graph |
scientific article |
Statements
A sharp upper bound for the rainbow 2-connection number of a 2-connected graph (English)
0 references
19 March 2013
0 references
rainbow edge-coloring
0 references
rainbow \(k\)-connection number
0 references
2-connected graph
0 references
ear decomposition
0 references
rainbow path
0 references
