On the rainbow connectivity of graphs: complexity and FPT algorithms (Q3087941)
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: On the rainbow connectivity of graphs: complexity and FPT algorithms |
scientific article; zbMATH DE number 5940000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the rainbow connectivity of graphs: complexity and FPT algorithms |
scientific article; zbMATH DE number 5940000 |
Statements
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms (English)
0 references
17 August 2011
0 references
0.9858314394950868
0 references
0.8847192525863647
0 references
0.876558244228363
0 references
