Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076)
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: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nordhaus-Gaddum-type theorem for rainbow connection number of graphs |
scientific article |
Statements
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (English)
0 references
26 September 2013
0 references
edge-colored graph
0 references
rainbow connection number
0 references
Nordhaus-Gaddum-type
0 references
0.8996014595031738
0 references
0.8927954435348511
0 references
0.866486132144928
0 references
0.8576093316078186
0 references
