Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (Q300179)
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: Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs |
scientific article; zbMATH DE number 6597261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs |
scientific article; zbMATH DE number 6597261 |
Statements
Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs (English)
0 references
23 June 2016
0 references
strong rainbow connection
0 references
rainbow vertex-connection
0 references
bipartite graph
0 references
NP-completeness
0 references
polynomial time
0 references
