Further hardness results on the rainbow vertex-connection number of graphs (Q385046): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On rainbow connection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hardness and algorithms for rainbow connection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3392716 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank | |||
Normal rank | |||
Latest revision as of 03:27, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Further hardness results on the rainbow vertex-connection number of graphs |
scientific article |
Statements
Further hardness results on the rainbow vertex-connection number of graphs (English)
0 references
29 November 2013
0 references
vertex-colored graph
0 references
rainbow vertex-connection number
0 references
NP-hard
0 references
NP-complete
0 references
