On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215)
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 6225266
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the rainbow connectivity of graphs: complexity and FPT algorithms |
scientific article; zbMATH DE number 6225266 |
Statements
On the rainbow connectivity of graphs: complexity and FPT algorithms (English)
0 references
11 November 2013
0 references
cactus
0 references
fixed parameter tractability
0 references
outerplanar graph
0 references
rainbow coloring
0 references
series-parallel graph
0 references
